Sciweavers

1615 search results - page 45 / 323
» Pathology in heuristic search
Sort
View
CG
2004
Springer
14 years 3 months ago
The Relative History Heuristic
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
Mark H. M. Winands, Erik C. D. van der Werf, H. Ja...
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
SAT
2004
Springer
89views Hardware» more  SAT 2004»
14 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
JSAC
2006
88views more  JSAC 2006»
13 years 10 months ago
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...
Nina Skorin-Kapov
HIS
2009
13 years 7 months ago
Scheduling Meta-Tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...
Hesam Izakian, Ajith Abraham, Václav Sn&aac...