Sciweavers

1350 search results - page 38 / 270
» Generalized Committed Choice
Sort
View
AAAI
2012
13 years 8 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
SOFSEM
2010
Springer
16 years 2 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
ICC
2007
IEEE
126views Communications» more  ICC 2007»
16 years 8 days ago
A General Expression of Rake Receiver Performance in DS-CDMA Downlink
— This paper deals with the orthogonality factor, a transfer coefficient which allows the transformation of a transmitted orthogonal signal into a received Gaussian noise to be ...
Thierry Clessienne
TGC
2005
Springer
15 years 11 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
ISARCS
2010
156views Hardware» more  ISARCS 2010»
15 years 8 months ago
A Road to a Formally Verified General-Purpose Operating System
Methods of formal description and verification represent a viable way for achieving fundamentally bug-free software. However, in reality only a small subset of the existing operati...
Martin Decký