Sciweavers

270 search results - page 39 / 54
» Dynamic Complexity Theory Revisited
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 4 months 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
CAE
2007
15 years 2 months ago
A Poetics of Simulation for Audiovisual Performance
Audiovisual performance is a fertile area for creative expression, an intersection of experimental cinema and computer music that has seen a groundswell of interest in recent year...
Randy Jones
IM
2007
15 years 1 months ago
Automated Availability Management Driven by Business Policies
—Policy-driven service management helps reduce IT management cost and it keeps the service management aligned with business objectives. While most of the previous research focuse...
Zhongtang Cai, Yuan Chen, Vibhore Kumar, Dejan S. ...
CORR
2004
Springer
90views Education» more  CORR 2004»
14 years 11 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
JAIR
2010
115views more  JAIR 2010»
14 years 10 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech