Sciweavers

3333 search results - page 271 / 667
» Optimal Power-Down Strategies
Sort
View
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
IJCAI
2003
15 years 8 months ago
Learning Minesweeper with Multirelational Learning
Minesweeper is a one-person game which looks deceptively easy to play, but where average human performance is far from optimal. Playing the game requires logical, arithmetic and p...
Lourdes Peña Castillo, Stefan Wrobel
MFCS
2010
Springer
15 years 5 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
AMR
2007
Springer
166views Multimedia» more  AMR 2007»
16 years 26 days ago
Smart Photo Sticking
Smart photo sticking is a novel strategy to automatically arrange a collection of photos in a pleasant collage. The proposed approach improves previous solutions both considering a...
Sebastiano Battiato, Gianluigi Ciocca, Francesca G...
154
Voted
FOSSACS
2004
Springer
16 years 1 days ago
Perfect-Information Stochastic Parity Games
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
Wieslaw Zielonka