2457 search results - page 20 / 492 » Local Search with Bootstrapping |
DAC
1999
ACM
14 years 8 months ago
1999
ACM
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
CPAIOR
2005
Springer
14 years 29 days ago
2005
Springer
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
AIPS
2006
13 years 8 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...
AAAI
2000
13 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...