419 search results - page 33 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
FLAIRS
2007
13 years 10 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
CP
1997
Springer
14 years 19 days ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
IAT
2003
IEEE
14 years 1 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
CP
2009
Springer
14 years 3 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...