Sciweavers

6584 search results - page 853 / 1317
» Distributed Shared Contexts
Sort
View
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
PPOPP
1990
ACM
15 years 11 months ago
Multi-Model Parallel Programming in Psyche
Many different parallel programming models, including lightweight processes that communicate with shared memory and heavyweight processes that communicate with messages, have been...
Michael L. Scott, Thomas J. LeBlanc, Brian D. Mars...
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
15 years 11 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...
CCGRID
2007
IEEE
15 years 11 months ago
A Computer-Aided Diagnostic System using a Global Data Grid Repository for the Evaluation of Ultrasound Carotid Images
A computer-aided diagnostic (CAD) method of calculating lumen and wall thickness of carotid vessels is presented. The CAD is able to measure the geometry of the lumen and plaque s...
Marco Antonio Gutierrez, Silvia Helena Gelas Lage,...
CONEXT
2007
ACM
15 years 10 months ago
Internet economics: the use of Shapley value for ISP settlement
Within the current Internet, autonomous ISPs implement bilateral agreements, with each ISP establishing agreements that suit its own local objective to maximize its profit. Peerin...
Richard T. B. Ma, Dah-Ming Chiu, John C. S. Lui, V...