Sciweavers

1068 search results - page 79 / 214
» On Space Bounded Server Algorithms
Sort
View
AAAI
2008
13 years 10 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
14 years 1 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
WSCG
2001
124views more  WSCG 2001»
13 years 9 months ago
Occlusion Evaluation in Hierarchical Radiosity
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
Yann Dupuy, Mathias Paulin, René Caubet
CORR
2007
Springer
146views Education» more  CORR 2007»
13 years 7 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 1 hour ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu