Matches in SemOpenAlex for { <https://semopenalex.org/work/W2279561282> ?p ?o ?g. }
- W2279561282 abstract "The initial formulation, or model, of a problem greatly influences the efficiency of the problem-solving process. Hence, modeling is critical in determining the performance of the problem-solving process and the quality of the produced solution. Unfortunately, modeling remains an art and has resisted automation. Additionally, slight variations in the characteristics of a given problem instance make it difficult to represent one class of problems using a unique model. Consequently, a robust approach to modeling is required. My thesis presents an automated approach to modeling. I exploit information contained in the input data in order to customize the constraint model of a given problem instance. I apply my approach to the area of Constraint Programming, focusing on a class of problems where a solution is guaranteed to exist for all problem instances. Specifically, I enhance a generic constraint model of a Constraint Satisfaction Problem (CSP) by adding new constraints to this model. These additional constraints are selected from a library of constraints by testing features of the problem instance at hand. The resulting constraint model is customized such that it best represents the problem instance given the data provided as input. The resulting framework is applicable to problems where instances are seeded with some initial input data. The techniques present in the framework are generally defined so they can be applied across domains. They cope with the uncertainty in the model refinement process by handling noisy data and incorrect inferences, generating additional information as needed. Furthermore, the framework uses Support Vector Machines (SVMs) to determine the scope of the inferred constraints and it automatically instantiates the constraint model in a format supported by a specialized constraint solver. I evaluate the effectiveness of my approach in two domains, Sudoku puzzles and the building identification (BID) problem. I show how it can infer the most specific constraint model given the available public information, scale to large problem instances, and use a SVM model to efficiently determine constraint scopes. I also evaluate the effectiveness of the framework for the BID problem in areas such as New Orleans and Belgrade where non-homogenous problem structures co-exist and across different Sudoku puzzle variations, demonstrating the resulting improvement when using an inferred model over a generic one. Additionally, I evaluate the framework's ability to augment the initial set of data points with new ones when applying an iterative constraint-propagation algorithm, which leads to more accurate constraint models." @default.
- W2279561282 created "2016-06-24" @default.
- W2279561282 creator A5074088845 @default.
- W2279561282 creator A5089542402 @default.
- W2279561282 date "2008-01-01" @default.
- W2279561282 modified "2023-09-27" @default.
- W2279561282 title "A general approach to using problem instance data for model refinement in constraint satisfaction problems" @default.
- W2279561282 cites W1498099185 @default.
- W2279561282 cites W1522863580 @default.
- W2279561282 cites W1523751874 @default.
- W2279561282 cites W1528090900 @default.
- W2279561282 cites W1537805943 @default.
- W2279561282 cites W1546091815 @default.
- W2279561282 cites W1560448248 @default.
- W2279561282 cites W1564783277 @default.
- W2279561282 cites W1566859793 @default.
- W2279561282 cites W1574862351 @default.
- W2279561282 cites W1590548082 @default.
- W2279561282 cites W1604792744 @default.
- W2279561282 cites W1733489975 @default.
- W2279561282 cites W1826823769 @default.
- W2279561282 cites W1876018582 @default.
- W2279561282 cites W1879587332 @default.
- W2279561282 cites W1947063854 @default.
- W2279561282 cites W1992917556 @default.
- W2279561282 cites W2051790368 @default.
- W2279561282 cites W2066814802 @default.
- W2279561282 cites W2101137458 @default.
- W2279561282 cites W2107571548 @default.
- W2279561282 cites W2108105780 @default.
- W2279561282 cites W2117182850 @default.
- W2279561282 cites W2118587067 @default.
- W2279561282 cites W2119168550 @default.
- W2279561282 cites W2119409601 @default.
- W2279561282 cites W2127412940 @default.
- W2279561282 cites W2127724972 @default.
- W2279561282 cites W2132513949 @default.
- W2279561282 cites W2135432705 @default.
- W2279561282 cites W2156909104 @default.
- W2279561282 cites W2157791002 @default.
- W2279561282 cites W2165666205 @default.
- W2279561282 cites W2166279570 @default.
- W2279561282 cites W2337098149 @default.
- W2279561282 cites W2761798304 @default.
- W2279561282 cites W2914916055 @default.
- W2279561282 cites W3108405576 @default.
- W2279561282 cites W3872339 @default.
- W2279561282 cites W2142423074 @default.
- W2279561282 cites W3020971664 @default.
- W2279561282 hasPublicationYear "2008" @default.
- W2279561282 type Work @default.
- W2279561282 sameAs 2279561282 @default.
- W2279561282 citedByCount "0" @default.
- W2279561282 crossrefType "journal-article" @default.
- W2279561282 hasAuthorship W2279561282A5074088845 @default.
- W2279561282 hasAuthorship W2279561282A5089542402 @default.
- W2279561282 hasConcept C111919701 @default.
- W2279561282 hasConcept C126255220 @default.
- W2279561282 hasConcept C137631369 @default.
- W2279561282 hasConcept C154945302 @default.
- W2279561282 hasConcept C173404611 @default.
- W2279561282 hasConcept C176783269 @default.
- W2279561282 hasConcept C183046576 @default.
- W2279561282 hasConcept C199622910 @default.
- W2279561282 hasConcept C2524010 @default.
- W2279561282 hasConcept C2776036281 @default.
- W2279561282 hasConcept C2777212361 @default.
- W2279561282 hasConcept C29230964 @default.
- W2279561282 hasConcept C33923547 @default.
- W2279561282 hasConcept C41008148 @default.
- W2279561282 hasConcept C44616089 @default.
- W2279561282 hasConcept C49937458 @default.
- W2279561282 hasConcept C98045186 @default.
- W2279561282 hasConceptScore W2279561282C111919701 @default.
- W2279561282 hasConceptScore W2279561282C126255220 @default.
- W2279561282 hasConceptScore W2279561282C137631369 @default.
- W2279561282 hasConceptScore W2279561282C154945302 @default.
- W2279561282 hasConceptScore W2279561282C173404611 @default.
- W2279561282 hasConceptScore W2279561282C176783269 @default.
- W2279561282 hasConceptScore W2279561282C183046576 @default.
- W2279561282 hasConceptScore W2279561282C199622910 @default.
- W2279561282 hasConceptScore W2279561282C2524010 @default.
- W2279561282 hasConceptScore W2279561282C2776036281 @default.
- W2279561282 hasConceptScore W2279561282C2777212361 @default.
- W2279561282 hasConceptScore W2279561282C29230964 @default.
- W2279561282 hasConceptScore W2279561282C33923547 @default.
- W2279561282 hasConceptScore W2279561282C41008148 @default.
- W2279561282 hasConceptScore W2279561282C44616089 @default.
- W2279561282 hasConceptScore W2279561282C49937458 @default.
- W2279561282 hasConceptScore W2279561282C98045186 @default.
- W2279561282 hasLocation W22795612821 @default.
- W2279561282 hasOpenAccess W2279561282 @default.
- W2279561282 hasPrimaryLocation W22795612821 @default.
- W2279561282 hasRelatedWork W1480084205 @default.
- W2279561282 hasRelatedWork W1564783277 @default.
- W2279561282 hasRelatedWork W1640224191 @default.
- W2279561282 hasRelatedWork W165040556 @default.
- W2279561282 hasRelatedWork W2042241295 @default.
- W2279561282 hasRelatedWork W205264562 @default.
- W2279561282 hasRelatedWork W2056108335 @default.