249 search results - page 49 / 50 » Algorithms and Sensors for Small Robot Path Following |
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
EC
1998
13 years 4 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
CVPR
2009
IEEE
14 years 9 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...