14779 search results - page 180 / 2956 » On Ultrametric Algorithmic Information |
165
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
212
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
173
click to vote
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
155
click to vote
FCT
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
179
click to vote
RC
2007
15 years 5 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...