Sciweavers

69 search results - page 12 / 14
» Let's Plan It Deductively!
Sort
View
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
14 years 11 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
AI
1998
Springer
14 years 11 months ago
Remote Agent: To Boldly Go Where No AI System Has Gone Before
Renewed motives for space exploration have inspired NASA to work toward the goal of establishing a virtual presence in space, through heterogeneous eets of robotic explorers. Info...
Nicola Muscettola, P. Pandurang Nayak, Barney Pell...
SIGMOD
2007
ACM
128views Database» more  SIGMOD 2007»
15 years 12 months ago
A SQL: 1999 code generator for the pathfinder xquery compiler
The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system (RDBMS). This code generator marks an im...
Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif ...
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
15 years 12 months ago
Query suspend and resume
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
Badrish Chandramouli, Christopher N. Bond, Shivnat...
TON
1998
90views more  TON 1998»
14 years 11 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt