5608 search results - page 290 / 1122 » On the Theory of Matchgate Computations |
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...
221
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
189
click to vote
EUROSYS
2007
ACM
16 years 3 months ago
2007
ACM
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
158
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
To understand how and why individuals make use of emerging information assimilation services on the Web as part of their daily routine, we combined video recordings of online acti...
183
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...