436 search results - page 49 / 88 » Ant algorithms and stigmergy |
187
Voted
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
169
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
134
Voted
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Generally, swarm models and algorithms consider synchronous agents, i.e., they act simultaneously. This hypothesis does not fit multi-agent simulators nor robotic systems. In this...
182
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
164
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...