2681 search results - page 233 / 537 » Problem F |
104
click to vote
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
106
click to vote
DAGSTUHL
2004
15 years 2 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
159
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
116
Voted
SIGECOM
2008
ACM
15 years 22 days ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
106
Voted
MICAI
2005
Springer
15 years 6 months ago
2005
Springer
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have b...