Sciweavers

617 search results - page 77 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
CP
2006
Springer
13 years 11 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
EVOW
2009
Springer
14 years 2 months ago
Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
Xiaomin Hu, Jun Zhang, Li-Ming Zhang
ACG
2003
Springer
14 years 1 months ago
Monte-Carlo Go Developments
We describe two Go programs,  ¢¡¤£¦¥ and  ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...
Bruno Bouzy, Bernard Helmstetter
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 8 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ANOR
2005
93views more  ANOR 2005»
13 years 8 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin