Sciweavers

1101 search results - page 211 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
135
Voted
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 2 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 6 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
AAAI
2006
15 years 3 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
119
Voted
SIROCCO
2004
15 years 3 months ago
Asynchronous Broadcast in Radio Networks
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
Bogdan S. Chlebus, Mariusz A. Rokicki
ATAL
2008
Springer
15 years 3 months ago
Sensing-based shape formation on modular multi-robot systems: a theoretical study
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
Chih-Han Yu, Radhika Nagpal