Sciweavers

176 search results - page 7 / 36
» Additive-Disjunctive Heuristics for Optimal Planning
Sort
View
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 9 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
CISS
2008
IEEE
14 years 2 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Heuristics for Network Coding in Wireless Networks
Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this artic...
Song Yean Cho, Cedric Adjih, Philippe Jacquet
ICRA
1999
IEEE
130views Robotics» more  ICRA 1999»
13 years 12 months ago
EquiDistance Diagram: A New Roadmap Method for Path Planning
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
S. Sathiya Keerthi, Chong Jin Ong, Eugene Huang, E...
AIPS
2009
13 years 8 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou