57 search results - page 4 / 12 » What Does the Future Hold for Theoretical Computer Science |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
IFIPTCS
2010
13 years 5 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
AGP
2010
IEEE
13 years 11 months ago
2010
IEEE
This chapter tackles the relation between declarative languages and multi-agent systems by following the dictates of the five Ws (and one H) that characterize investigations. The ...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...