2924 search results - page 502 / 585 » Lower Bounds in Distributed Computing |
121
click to vote
SP
2006
IEEE
15 years 10 months ago
2006
IEEE
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
150
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
171
click to vote
ASIAN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
126
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
163
click to vote
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...