Sciweavers

70 search results - page 4 / 14
» Better Quasi-Ordered Transition Systems
Sort
View
GI
2009
Springer
13 years 5 months ago
The relation between protocols and games
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...
Johannes Reich
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 2 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
ABIALS
2008
Springer
13 years 9 months ago
Anticipatory Learning Classifier Systems and Factored Reinforcement Learning
Factored Reinforcement Learning (frl) is a new technique to solve Factored Markov Decision Problems (fmdps) when the structure of the problem is not known in advance. Like Anticipa...
Olivier Sigaud, Martin V. Butz, Olga Kozlova, Chri...
PE
2007
Springer
130views Optimization» more  PE 2007»
13 years 7 months ago
Performability analysis of clustered systems with rejuvenation under varying workload
This paper develops time-based rejuvenation policies to improve the performability measures of a cluster system. Three rejuvenation policies, namely standard rejuvenation, delayed...
Dazhi Wang, Wei Xie, Kishor S. Trivedi
CSCW
2012
ACM
12 years 3 months ago
Recommending routes in the context of bicycling: algorithms, evaluation, and the value of personalization
Users have come to rely on automated route finding services for driving, public transit, walking, and bicycling. Current state of the art route finding algorithms typically rely...
Reid Priedhorsky, David Pitchford, Shilad Sen, Lor...