2168 search results - page 311 / 434 » Randomized Algorithms and Complexity Theory |
127
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
129
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
129
click to vote
AMW
2009
15 years 1 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
156
click to vote
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
143
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...