Sciweavers

65 search results - page 12 / 13
» Local Search Techniques for Temporal Planning in LPG
Sort
View
CP
2004
Springer
13 years 11 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
EOR
2008
87views more  EOR 2008»
13 years 5 months ago
Robust surgery loading
We consider the robust surgery loading problem for a hospital's operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating roo...
Erwin W. Hans, Gerhard Wullink, Mark van Houdenhov...
AAAI
2000
13 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
IAT
2010
IEEE
13 years 3 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
ATAL
2009
Springer
14 years 11 days ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...