836 search results - page 4 / 168 » On the Complexity of Train Assignment Problems |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
AAAI
2008
14 years 3 days ago
2008
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
LION
2007
Springer
14 years 3 months ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
COR
2008
13 years 9 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...