Sciweavers

1278 search results - page 84 / 256
» The Complexity of Weighted Boolean
Sort
View
IJRR
2006
126views more  IJRR 2006»
13 years 10 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
14 years 10 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio