Sciweavers

1369 search results - page 171 / 274
» Lattice computations for random numbers
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
Performance Analysis of Distributed Search in Open Agent Systems
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
FOCS
2002
IEEE
14 years 2 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
AINA
2010
IEEE
14 years 2 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
DCC
1998
IEEE
14 years 1 months ago
Optimal Multiple Description Transform Coding of Gaussian Vectors
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...
Vivek K. Goyal, Jelena Kovacevic
PERCOM
2010
ACM
14 years 1 months ago
Sell your experiences: a market mechanism based incentive for participatory sensing
—This paper studies economic models of user participation incentive in participatory sensing applications. User participation is the most important element in participatory sensi...
Juong-Sik Lee, Baik Hoh