5624 search results - page 868 / 1125 » On Conditional Covering Problem |
115
click to vote
MST
2007
15 years 2 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
124
click to vote
CP
2010
Springer
15 years 1 months ago
2010
Springer
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
123
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
160
click to vote
TSP
2010
14 years 9 months ago
2010
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
183
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...