Sciweavers

2108 search results - page 381 / 422
» Constrained Heuristic Search
Sort
View
AAMAS
2005
Springer
14 years 11 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
AIR
2005
114views more  AIR 2005»
14 years 11 months ago
Airport Gate Scheduling with Time Windows
In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can...
Andrew Lim, Brian Rodrigues, Yi Zhu
KBS
2007
56views more  KBS 2007»
14 years 11 months ago
Domain-dependent distributed models for railway scheduling
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...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
MICRO
2002
IEEE
121views Hardware» more  MICRO 2002»
14 years 11 months ago
Convergent scheduling
Convergent scheduling is a general framework for instruction scheduling and cluster assignment for parallel, clustered architectures. A convergent scheduler is composed of many ind...
Walter Lee, Diego Puppin, Shane Swenson, Saman P. ...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 10 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...