4218 search results - page 279 / 844 » Complete sets of cooperations |
179
Voted
INFOCOM
2009
IEEE
16 years 23 days ago
2009
IEEE
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
165
click to vote
GPEM
2008
15 years 6 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
172
click to vote
KBSE
2007
IEEE
16 years 12 days ago
2007
IEEE
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
132
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
171
click to vote
WINE
2009
Springer
16 years 21 days ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...