Sciweavers

2099 search results - page 406 / 420
» Distributed constraint optimization with structured resource...
Sort
View
MIDDLEWARE
2007
Springer
15 years 5 months ago
Flexible matching and ranking of web service advertisements
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunction...
Navid Ahmadi, Walter Binder
83
Voted
IPPS
2006
IEEE
15 years 5 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
SIROCCO
2003
15 years 1 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 2 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
IPPS
2006
IEEE
15 years 5 months ago
Broadcasting and routing in faulty mesh networks
— Broadcasting is a data communication task in which one processor sends the same message to all other processors. Routing is a task where a source processor sends a message to a...
Milos Stojmenovic, Amiya Nayak