2393 search results - page 246 / 479 » Bounds-Consistent Local Search |
118
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we report on a study in which genetic algorithms are applied to the analysis of noisy time-series signals, which is related to the problem of analyzing the motion ch...
134
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
129
Voted
AAAI
2004
15 years 5 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
128
Voted
UAI
2003
15 years 5 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
151
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...