Sciweavers

44 search results - page 3 / 9
» From Parity and Payoff Games to Linear Programming
Sort
View
ICALP
2007
Springer
14 years 25 days ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 9 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
ENTCS
2010
105views more  ENTCS 2010»
13 years 9 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
ICML
2007
IEEE
14 years 9 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 1 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...