314 search results - page 27 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
CP
2005
Springer
14 years 1 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
KBS
2007
13 years 7 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
FLAIRS
2007
13 years 10 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...
AI
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
WG
2004
Springer
14 years 1 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...