5692 search results - page 103 / 1139 » Challenges and Unsolved Problems |
119
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
102
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
140
Voted
HEURISTICS
2010
14 years 10 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
The objectives of this paper are to describe a steady-state version of the Age-Layered Population Structure (ALPS) Evolutionary Algorithm (EA) and to compare it against other GAs ...
101
click to vote
SARA
2009
Springer
15 years 7 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...