Sciweavers

617 search results - page 25 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
14 years 8 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
101
Voted
INFOCOM
2000
IEEE
15 years 2 months ago
Alternate Path Routing for Multicast
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
Daniel Zappala
68
Voted
AAAI
1997
14 years 11 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz
68
Voted
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 3 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
CG
2006
Springer
15 years 1 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert