8413 search results - page 408 / 1683 » Ordering Problem Subgoals |
166
click to vote
AAAI
2007
15 years 9 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
172
click to vote
AIPS
2008
15 years 9 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
208
click to vote
FLAIRS
2007
15 years 9 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...
243
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
164
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...