Sciweavers

20 search results - page 4 / 4
» Strategy Iteration using Non-Deterministic Strategies for So...
Sort
View
LPAR
2004
Springer
13 years 10 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
AMC
2008
86views more  AMC 2008»
13 years 5 months ago
Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
Muneomi Sagara, Hiroaki Mukaidani, Toru Yamamoto
ICC
2007
IEEE
192views Communications» more  ICC 2007»
13 years 11 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
LICS
2008
IEEE
13 years 11 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
MOBIHOC
2007
ACM
14 years 4 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang