Sciweavers

440 search results - page 58 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
168
Voted
ICML
1995
IEEE
16 years 3 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
CEC
2007
IEEE
15 years 6 months ago
A hybrid evolutionary approach to the university course timetabling problem
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
Salwani Abdullah, Edmund K. Burke, Barry McCollum
115
Voted
ISER
2004
Springer
173views Robotics» more  ISER 2004»
15 years 8 months ago
Synergies in Feature Localization by Air-Ground Robot Teams
Abstract. This paper describes the implementation of a decentralized architecture for autonomous teams of aerial and ground vehicles engaged in active perception. We provide a theo...
Ben Grocholsky, Selcuk Bayraktar, Vijay Kumar, Cam...
238
Voted
NLP
2000
15 years 6 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
118
Voted
AAAI
2000
15 years 3 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