Sciweavers

84 search results - page 5 / 17
» Distributed search in railway scheduling problems
Sort
View
COR
2010
177views more  COR 2010»
14 years 9 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
GLOBECOM
2008
IEEE
15 years 4 months ago
Prioritized Maximal Scheduling in Wireless Networks
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
Qiao Li, Rohit Negi
CP
2006
Springer
15 years 1 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
EAAI
2007
154views more  EAAI 2007»
14 years 9 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
Ahlem Ben Hassine, Tu Bao Ho
ICPP
1999
IEEE
15 years 1 months ago
Efficient Techniques for Distributed Implementation of Search-Based AI Systems
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
Gopal Gupta, Enrico Pontelli