3455 search results - page 401 / 691 » Generalized Game Trees |
243
click to vote
CPP
2011
14 years 6 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
176
click to vote
FOCS
2005
IEEE
16 years 10 days ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
220
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
180
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...