Sciweavers

272 search results - page 12 / 55
» Lazy tree splitting
Sort
View
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
14 years 1 days ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
SENSYS
2006
ACM
14 years 1 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
VLDB
1995
ACM
194views Database» more  VLDB 1995»
13 years 11 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
ICALP
2007
Springer
14 years 1 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
INFOCOM
2000
IEEE
13 years 12 months ago
Constrained Multicast Routing in WDM Networks with Sparse Light Splitting
Abstract— As WDM technology matures and multicast applications become increasingly popular, supporting multicast at the WDM layer becomes an important and yet challenging topic. ...
Xijun Zhang, John Wei, Chunming Qiao