Sciweavers

153 search results - page 4 / 31
» Some Decision Problems of Enormous Complexity
Sort
View
RT
1998
Springer
13 years 10 months ago
Three Point Clustering for Radiance Computations
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...
Marc Stamminger, Philipp Slusallek, Hans-Peter Sei...
FOSSACS
2007
Springer
14 years 6 days ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
ICONIP
2009
13 years 3 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa
CJ
2010
132views more  CJ 2010»
13 years 3 months ago
Internet Failures: an Emergent Sea of Complex Systems and Critical Design Errors?
Complex systems researchers have looked to the Internet as a possible source of interesting emergent behaviour. Indeed, some high profile failures, and some low level phenomena, m...
Jon Crowcroft
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 19 days ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...