Sciweavers

2157 search results - page 96 / 432
» Binary ant algorithm
Sort
View
133
Voted
ECAI
1992
Springer
15 years 4 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
72
Voted
SODA
2000
ACM
83views Algorithms» more  SODA 2000»
15 years 1 months ago
Restructuring ordered binary trees
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
William S. Evans, David G. Kirkpatrick
EC
2008
153views ECommerce» more  EC 2008»
15 years 22 hour ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
116
Voted
EUROCRYPT
2012
Springer
13 years 2 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
106
Voted
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 1 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt