Sciweavers

105 search results - page 9 / 21
» Linear Time Algorithm for Weak Parity Games
Sort
View
ADVIS
2004
Springer
13 years 11 months ago
On Families of New Adaptive Compression Algorithms Suitable for Time-Varying Source Data
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...
Luís G. Rueda, B. John Oommen
GLOBECOM
2007
IEEE
14 years 2 months ago
Non-Cooperative Design of Translucent Networks
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...
Benoît Châtelain, Shie Mannor, Fran&cc...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 9 months ago
Computing Minimal Spanning Subgraphs in Linear Time
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 ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
ECCTD
2011
108views more  ECCTD 2011»
12 years 7 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
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...
Michael Soudan, Christian Vogel
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 12 months ago
Fast algorithms for finding randomized strategies in game trees
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...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...