Sciweavers

95 search results - page 8 / 19
» Computing the communication costs of item allocation
Sort
View
PODC
2003
ACM
15 years 2 months ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
ICMAS
1998
14 years 11 months ago
Implementation Issues on Market-Based QoS Control
In this paper, we discuss two major tradeoffs, spatial and temporal tradeoffs, that appear when applying marketbased computing to multimedia network applications. The former appea...
Hirofumi Yamaki, Yutaka Yamauchi, Toru Ishida
RSS
2007
119views Robotics» more  RSS 2007»
14 years 11 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit
ICDCS
2000
IEEE
15 years 2 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang