Sciweavers

12194 search results - page 2086 / 2439
» Numberings Optimal for Learning
Sort
View
TACAS
2005
Springer
129views Algorithms» more  TACAS 2005»
16 years 8 days ago
A New Algorithm for Strategy Synthesis in LTL Games
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
Aidan Harding, Mark Ryan, Pierre-Yves Schobbens
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
16 years 8 days ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
WAC
2005
Springer
123views Communications» more  WAC 2005»
16 years 8 days ago
Service Evolution in a Nomadic Wireless Environment
Abstract. In this paper, we present and analyze a framework for selfevolving autonomic services in a wireless nomadic environment. We present a disconnected network architecture, w...
Iacopo Carreras, Francesco De Pellegrini, Daniele ...
WINE
2005
Springer
118views Economy» more  WINE 2005»
16 years 8 days ago
Nash Equilibria and Dominant Strategies in Routing
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...
Weizhao Wang, Xiang-Yang Li, Xiaowen Chu
DMSN
2004
ACM
16 years 7 days ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
« Prev « First page 2086 / 2439 Last » Next »