2157 search results - page 128 / 432 » Binary ant algorithm |
102
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
122
Voted
ICUMT
2009
14 years 10 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
106
click to vote
NI
2011
14 years 3 months ago
2011
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
129
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
102
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...