3946 search results - page 490 / 790 » The computational complexity of choice sets |
193
Voted
COMPGEOM
2003
ACM
16 years 20 hour ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
164
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
204
click to vote
ICARCV
2002
IEEE
15 years 11 months ago
2002
IEEE
Cooperative robotic systems provide design and implementation challenges that are not easy to solve. This paper describes a parallel implementation for evolving cooperative roboti...
153
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
178
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an algorithm for simultaneous localization and mapping for a mobile robot using monocular vision and odometry. The approach uses Variable State Dimension Filte...