1802 search results - page 251 / 361 » Complexity Theory for Operators in Analysis |
179
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
197
click to vote
WSNA
2003
ACM
15 years 11 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
140
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this study, we explore the nature of team interaction and the role of temporal coordination in asynchronously communicating global virtual project teams (GVPTs). Drawing on Tim...
153
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
211
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...