3514 search results - page 9 / 703 » A search space |
GECCO
2006
Springer
14 years 13 days ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
CEC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
CVPR
2001
IEEE
14 years 10 months ago
2001
IEEE
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
EVOW
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
CLA
2007
13 years 10 months ago
2007
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...