Sciweavers

721 search results - page 111 / 145
» Graphs with Large Obstacle Numbers
Sort
View
ECP
1997
Springer
68views Robotics» more  ECP 1997»
14 years 1 months ago
Ignoring Irrelevant Facts and Operators in Plan Generation
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
EUROSYS
2010
ACM
14 years 1 months ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...
WAE
2001
281views Algorithms» more  WAE 2001»
13 years 10 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 9 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
TON
2010
109views more  TON 2010»
13 years 7 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu