Sciweavers

3356 search results - page 69 / 672
» Determining Consensus Numbers
Sort
View
WDAG
1998
Springer
87views Algorithms» more  WDAG 1998»
14 years 1 months ago
Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...
James H. Anderson, Rohit Jain, David Ott
AAAI
2004
13 years 10 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 9 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang
SASN
2006
ACM
14 years 2 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 1 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang