Sciweavers

373 search results - page 31 / 75
» On Deterministic Approximation of DNF
Sort
View
ICML
2003
IEEE
15 years 11 months ago
BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
Vincent Conitzer, Tuomas Sandholm
95
Voted
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 11 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
52
Voted
AIPS
2010
15 years 18 days ago
Improving Determinization in Hindsight for On-line Probabilistic Planning
Recently, `determinization in hindsight' has enjoyed surprising success in on-line probabilistic planning. This technique evaluates the actions available in the current state...
Sung Wook Yoon, Wheeler Ruml, J. Benton, Minh Do
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Hybrid Numerical Solution of the Chemical Master Equation
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
Thomas A. Henzinger, Maria Mateescu, Linar Mikeev,...
PODC
2010
ACM
15 years 2 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela