Sciweavers

721 search results - page 60 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CP
2007
Springer
15 years 3 months ago
Reformulating CSPs for Scalability with Application to Geospatial Reasoning
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
IAT
2003
IEEE
15 years 3 months ago
Problem-solving in open environments
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...
Santiago Macho-Gonzalez, Boi Faltings
AAAI
1997
14 years 11 months ago
Effective Redundant Constraints for Online Scheduling
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 ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
PACT
1999
Springer
15 years 2 months ago
Parallel Implementation of Constraint Solving
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 ...
Alvaro Ruiz-Andino, Lourdes Araujo, Fernando S&aac...
FLAIRS
2007
15 years 2 days ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
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...
Pavel Surynek, Roman Barták