2069 search results - page 98 / 414 » Linear time algorithms for Clobber |
146
click to vote
JDA
2006
15 years 4 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
131
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Flow statistics is a basic task of passive measurement and has been widely used to characterize the state of the network. Adaptive Non-Linear Sampling (ANLS)is one of the most a...
142
Voted
SODA
2008
ACM
15 years 5 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...
139
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
132
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...