Sciweavers

7092 search results - page 1215 / 1419
» Parallelizing constraint programs
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
ICDCS
2006
IEEE
14 years 2 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
IPPS
2006
IEEE
14 years 2 months ago
Composite Abortable Locks
The need to allow threads to abort an attempt to acquire a lock (sometimes called a timeout) is an interesting new requirement driven by state-of-the-art database applications wit...
Virendra J. Marathe, Mark Moir, Nir Shavit
IPPS
2006
IEEE
14 years 2 months ago
Supporting self-adaptation in streaming data mining applications
There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time ...
Liang Chen, Gagan Agrawal
PODC
2006
ACM
14 years 2 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
« Prev « First page 1215 / 1419 Last » Next »