2582 search results - page 175 / 517 » Scheduling in a Planning Environment |
132
click to vote
AAAI
2004
15 years 8 months ago
2004
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
198
click to vote
JSAC
2007
15 years 6 months ago
2007
— In WDM optical networks connection requests can be classified into three different types: Permanent Lightpath Demands (PLDs), Scheduled Lightpath Demands (SLDs), and Random Li...
273
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
171
click to vote
ICRA
2007
IEEE
16 years 27 days ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
156
click to vote
ICRA
2007
IEEE
16 years 27 days ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...