2157 search results - page 192 / 432 » Binary ant algorithm |
179
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
153
click to vote
AAECC
2006
Springer
16 years 11 days ago
2006
Springer
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
163
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
143
click to vote
AAECC
2001
Springer
15 years 11 months ago
2001
Springer
This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hie...
158
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem an...