559 search results - page 36 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
168
click to vote
PACT
1999
Springer
15 years 7 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 ...
110
click to vote
FLAIRS
2007
15 years 5 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...
111
click to vote
IAT
2003
IEEE
15 years 8 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...
114
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
101
click to vote
IJCAI
2001
15 years 4 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...