1539 search results - page 219 / 308 » Fast and Simple Methods For Computing Control Points |
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
VCIP
2003
13 years 10 months ago
2003
In this paper, we present a simple method to almost quadruple the spatial resolution of aliased images. From a set of four low resolution, undersampled and shifted images, a new i...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— Most of present work for autonomous navigation in dynamic environment doesn’t take into account the dynamics of the obstacles or the limits of the perception system. To face ...
GECCO
2011
Springer
13 years 14 days ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...