31 search results - page 1 / 7 » Evaluating hybrid constraint tightening for scheduling agent... |
205
Voted
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
191
Voted
AAAI
2008
15 years 10 months ago
2008
Hybrid Scheduling Problems (HSPs) contain both temporal and finite-domain variables, as well as constraints between them. A hybrid constraint over temporal and finite-domain varia...
226
Voted
AAMAS
2011
Springer
15 years 2 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
203
Voted
ECAI
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
185
Voted
ATAL
2005
Springer
16 years 1 months ago
2005
Springer
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...