105 search results - page 9 / 21 » Linear Time Algorithm for Weak Parity Games |
ADVIS
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we introduce a new approach to adaptive coding which utilizes Stochastic Learning-based Weak Estimation (SLWE) techniques to adaptively update the probabilities of t...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
SODA
1992
ACM
14 years 11 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
96
Voted
ECCTD
2011
13 years 10 months ago
2011
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
121
click to vote
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...