Sciweavers

2157 search results - page 83 / 432
» Binary ant algorithm
Sort
View
99
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 4 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
IPPS
2007
IEEE
15 years 6 months ago
Cluster-dot Screening by Local Exhaustive Search with Hardware Accelaration
Screening is an important task to convert a continuoustone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorit...
Yasuaki Ito, Koji Nakano
93
Voted
ICARIS
2005
Springer
15 years 6 months ago
A Generic Framework for Population-Based Algorithms, Implemented on Multiple FPGAs
Many bio-inspired algorithms (evolutionary algorithms, artificial immune systems, particle swarm optimisation, ant colony optimisation, …) are based on populations of agents. Ste...
John Newborough, Susan Stepney
145
Voted
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 10 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
83
Voted
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 4 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen