2796 search results - page 163 / 560 » The coolest path problem |
203
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
158
click to vote
CCCG
2010
15 years 7 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
134
click to vote
DCG
2007
15 years 6 months ago
2007
In this paper we study the following simple and mind-puzzling problem: Can a model train car, which runs along an intricate track complete a full cycle around it? In our paper a t...
164
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
198
click to vote
NIPS
2004
15 years 7 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...