Sciweavers

3206 search results - page 447 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
ALGOSENSORS
2009
Springer
13 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ADHOCNOW
2008
Springer
14 years 3 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 2 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison
DATE
2006
IEEE
119views Hardware» more  DATE 2006»
14 years 1 months ago
Compiler-driven FPGA-area allocation for reconfigurable computing
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...
Elena Moscu Panainte, Koen Bertels, Stamatis Vassi...
EGH
2004
Springer
14 years 1 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan