150 search results - page 23 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
AIPS
2000
14 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
109
click to vote
ECAI
1992
Springer
15 years 1 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
77
Voted
FLAIRS
2007
14 years 12 months ago
2007
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
70
Voted
SGAI
2007
Springer
15 years 3 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...