Sciweavers

1380 search results - page 151 / 276
» A General Polynomial Sieve
Sort
View
CCCG
2003
13 years 10 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
NIPS
2004
13 years 10 months ago
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments
A reactive environment is one that responds to the actions of an agent rather than evolving obliviously. In reactive environments, experts algorithms must balance exploration and ...
Daniela Pucci de Farias, Nimrod Megiddo
AAAI
1996
13 years 10 months ago
Learning to Take Actions
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
Roni Khardon
ATAL
2010
Springer
13 years 10 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 10 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella