Sciweavers

14190 search results - page 2309 / 2838
» computing 2008
Sort
View
203
Voted
AIPS
2010
15 years 9 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
AVI
2008
15 years 9 months ago
Agent warp engine: formula based shape warping for networked applications
Computer visualization and networking have advanced dramatically over the last few years, partially driven by the exploding video game market. 3D hardware acceleration has reached...
Alexander Repenning, Andri Ioannidou
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
AISB
2008
Springer
15 years 9 months ago
Cognition without content
According to the traditional conception of the mind, semantical content is perhaps the most important feature distinguishing mental from non-mental systems. And this traditional co...
Paul Schweizer
APN
2008
Springer
15 years 9 months ago
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
Morgan Magnin, Didier Lime, Olivier H. Roux
« Prev « First page 2309 / 2838 Last » Next »