1813 search results - page 138 / 363 » Instance Pruning Techniques |
182
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
131
click to vote
AAAI
2004
15 years 7 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
180
click to vote
AIPS
2006
15 years 7 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
163
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Detecting the time of occurrence of an acoustic event (for instance, a cheer) embedded in a longer soundtrack is useful and important for applications such as search and retrieval...
145
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...