Sciweavers

2157 search results - page 40 / 432
» Binary ant algorithm
Sort
View
120
Voted
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 2 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
CEC
2008
IEEE
15 years 7 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
AEI
2004
150views more  AEI 2004»
15 years 9 days ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
115
Voted
GPEM
2002
163views more  GPEM 2002»
15 years 6 days ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
139
Voted
PAMI
2012
13 years 2 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...