Sciweavers

182 search results - page 33 / 37
» Benchmarking the Task Graph Scheduling Algorithms
Sort
View
CPAIOR
2007
Springer
15 years 3 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
IJRR
2010
115views more  IJRR 2010»
14 years 6 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
ECRA
2010
111views more  ECRA 2010»
14 years 9 months ago
RDRP: Reward-Driven Request Prioritization for e-Commerce web sites
Meeting client Quality-of-Service (QoS) expectations proves to be a difficult task for the providers of e-Commerce services, especially when web servers experience overload condit...
Alexander Totok, Vijay Karamcheti
AAAI
2000
14 years 11 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
107
Voted
AIPS
2010
14 years 10 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...