Sciweavers

163 search results - page 27 / 33
» Solving Simple Stochastic Games
Sort
View
IEEEVAST
2010
13 years 2 months ago
Comparing different levels of interaction constraints for deriving visual problem isomorphs
Interaction and manual manipulation have been shown in the cognitive science literature to play a critical role in problem solving. Given different types of interactions or constr...
Wenwen Dou, Caroline Ziemkiewicz, Lane Harrison, D...
COLING
1996
13 years 9 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CORR
2011
Springer
210views Education» more  CORR 2011»
12 years 11 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
SI3D
2010
ACM
14 years 2 months ago
Volumetric obscurance
Obscurance and Ambient Occlusion (AO) are popular techniques in both film and games that model how ambient light is shadowed. While it is largely a solved problem for static scen...
Bradford James Loos, Peter-Pike Sloan
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 3 months ago
A Unifying Framework for Linearly Solvable Control
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
Krishnamurthy Dvijotham, Emanuel Todorov