97 search results - page 15 / 20 » Approximate center points with proofs |
COCO
2003
Springer
14 years 25 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
NIPS
1993
13 years 9 months ago
1993
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...