2457 search results - page 243 / 492 » Local Search with Bootstrapping |
141
click to vote
AAAI
2004
15 years 6 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...
143
click to vote
UAI
2003
15 years 6 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...
167
click to vote
CORR
2011
Springer
15 years 2 days 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...
308
Voted
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
176
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
As user demands become increasingly sophisticated, search engines today are competing in more than just returning document results from the Web. One area of competition is providi...