330 search results - page 28 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
AAAI
2006
13 years 9 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
AAAI
1994
13 years 9 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
FLAIRS
2007
13 years 10 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
ECAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...
JSS
2010
13 years 2 months ago
2010
Software product-lines (SPLs) are software architectures that can be readily reconfigured for different project requirements. A key part of an SPL is a model that captures the rul...