41 search results - page 5 / 9 » Computing simple paths among obstacles |
GD
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes an autonomous robot system designed to solve the challenging task of geocaching. Geocaching involves locating a goal object in an outdoor environment given on...
CHI
2002
ACM
15 years 9 months ago
2002
ACM
We describe the design and use of a system facilitating the sharing of calendar information between remotely located, multi-generational family members. Most previous work in this...
CSIE
2009
IEEE
15 years 4 months ago
2009
IEEE
We present the current results of our ongoing research in achieving efficient control of a flying robot for a wide variety of possible applications. A lightweight small indoor h...
113
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....