Sciweavers

183 search results - page 6 / 37
» Linear-Time Algorithms in Memory Hierarchies
Sort
View
IJCAI
2007
13 years 8 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 16 days ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
13 years 12 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...
SAC
2006
ACM
14 years 1 months ago
Operating system multilevel load balancing
This paper describes an algorithm that allows Linux to perform multilevel load balancing in NUMA computers. The Linux scheduler implements a load balancing algorithm that uses str...
Mônica Corrêa, Avelino Francisco Zorzo...
CGF
2006
136views more  CGF 2006»
13 years 7 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha