Sciweavers

3049 search results - page 377 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
151
Voted
COCO
2004
Springer
95views Algorithms» more  COCO 2004»
16 years 7 hour ago
Consequences and Limits of Nonlocal Strategies
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal...
Richard Cleve, Peter Høyer, Benjamin Toner,...
CISS
2008
IEEE
16 years 1 months ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...
ISCI
2008
145views more  ISCI 2008»
15 years 6 months ago
Aggregation in sensor networks with a user-provided quality of service goal
Significant research has been devoted to aggregation in sensor networks with a view to optimize its performance. Existing research has mostly concentrated on maximizing network li...
Zhen He, Byung Suk Lee, Xiaoyang Sean Wang
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 10 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...