2027 search results - page 91 / 406 » When is it best to best-respond |
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
101
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
Given two geographic databases, a fusion algorithm should produce all pairs of corresponding objects (i.e., objects that represent the same real-world entity). Four fusion algorit...
114
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
105
Voted
VRST
2003
ACM
15 years 6 months ago
2003
ACM
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
106
Voted
DAWAK
2003
Springer
15 years 6 months ago
2003
Springer
View materialization is recognized to be one of the most effective ways to increase the Data Warehouse performance; nevertheless, due to the computational complexity of the techniq...