Sciweavers

9119 search results - page 1323 / 1824
» A Simultaneous Search Problem
Sort
View
LION
2009
Springer
210views Optimization» more  LION 2009»
16 years 1 months ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...
MFCS
2009
Springer
16 years 1 months ago
Self-indexed Text Compression Using Straight-Line Programs
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
Francisco Claude, Gonzalo Navarro
SAT
2009
Springer
119views Hardware» more  SAT 2009»
16 years 1 months ago
Backdoors in the Context of Learning
The concept of backdoor variables has been introduced as a structural property of combinatorial problems that provides insight into the surprising ability of modern satisfiability...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
CEC
2008
IEEE
16 years 1 months ago
Analysis of reproduction operator in Bacterial Foraging Optimization Algorithm
— One of the major driving forces of Bacterial Foraging Optimization Algorithm (BFOA) is the reproduction phenomenon of virtual bacteria each of which models one trial solution o...
Ajith Abraham, Arijit Biswas, Sambarta Dasgupta, S...
CEC
2008
IEEE
16 years 1 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan
« Prev « First page 1323 / 1824 Last » Next »