2412 search results - page 372 / 483 » Which Problems Have Strongly Exponential Complexity |
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
IVC
2007
13 years 7 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Convoy driving on public highways is a useful phenomena which increases the safety and the throughput of the highway. We present an approach through which a wireless Convoy Dri...