2157 search results - page 63 / 432 » Binary ant algorithm |
105
Voted
CIIT
2004
15 years 1 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
110
click to vote
AINA
2006
IEEE
15 years 6 months ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
FODO
1989
Springer
15 years 4 months ago
1989
Springer
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
73
Voted
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
EVOW
2006
Springer
15 years 4 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...