1197 search results - page 182 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
RTAS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
ECML
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Motivated by the analogies to statistical physics, the deterministic annealing (DA) method has successfully been demonstrated in a variety of application. In this paper, ...
AGP
1996
IEEE
14 years 8 days ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
IJCAI
2003
13 years 9 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...