837 search results - page 4 / 168 » Hard combinators |
136
click to vote
AGENTS
1999
Springer
15 years 6 months ago
1999
Springer
We describe the interface between a real-time resource allocation system with an AI planner in order to create fault-tolerant plans that are guaranteed to execute in hard real-tim...
114
click to vote
DATE
2009
IEEE
15 years 9 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
129
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
128
click to vote
JCO
2007
15 years 2 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
178
click to vote
CPAIOR
2010
Springer
15 years 14 days ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...