808 search results - page 39 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
AAAI
1997
14 years 11 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
PACT
1999
Springer
15 years 1 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
72
Voted
FLAIRS
2007
14 years 12 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
71
Voted
IAT
2003
IEEE
15 years 2 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...