Sciweavers

62 search results - page 6 / 13
» A Hybrid of Inference and Local Search for Distributed Combi...
Sort
View
ENGL
2008
118views more  ENGL 2008»
13 years 7 months ago
Hybrid Architecture of Genetic Algorithm and Simulated Annealing
This paper discusses novel dedicated hardware architecture for hybrid optimization based on Genetic algorithm (GA) and Simulated Annealing (SA). The proposed architecture achieves ...
Masaya Yoshikawa, Hironori Yamauchi, Hidekazu Tera...
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 21 days ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 2 months ago
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS
Markov Logic Networks (MLNs) have emerged as a powerful framework that combines statistical and logical reasoning; they have been applied to many data intensive problems including...
Feng Niu, Christopher Ré, AnHai Doan, Jude ...
JCO
1998
136views more  JCO 1998»
13 years 7 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
AI
1999
Springer
13 years 7 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle