Sciweavers

2542 search results - page 365 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
AAAI
2010
13 years 11 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
NETWORKING
2007
13 years 11 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
AAAI
2004
13 years 11 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
GEOINFO
2003
13 years 11 months ago
Planning Brazilian Urban Traffic with a Geographic Application Software
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
Juliano Lopes de Oliveira, André Constantin...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 11 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...