1612 search results - page 129 / 323 » Analysing Randomized Distributed Algorithms |
128
Voted
IJCAI
2001
15 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
132
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
145
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
166
click to vote
IPSN
2010
Springer
15 years 11 months ago
2010
Springer
Motion capture using wireless inertial measurement units (IMUs) has many advantages over other techniques. Achieving accurate tracking with IMUs presents a processing challenge, e...
118
Voted
SPAA
1994
ACM
15 years 9 months ago
1994
ACM
We present a work-optimal randomized algorithm for simulating a shared memory machine (pram) on an optical communication parallel computer (ocpc). The ocpc model is motivated by t...