348 search results - page 49 / 70 » Search Ordering Heuristics for Restarts-Based Constraint Sol... |
ECAI
2004
Springer
14 years 27 days ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
AIR
2004
13 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
CPAIOR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
AIPS
2000
13 years 8 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...