1639 search results - page 95 / 328 » Anytime Heuristic Search |
COR
2006
15 years 20 days ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
115
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
114
Voted
KDD
2002
ACM
16 years 1 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
123
click to vote
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
122
Voted
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...