Sciweavers

7106 search results - page 57 / 1422
» Restricted Complexity, General Complexity
Sort
View
BMCBI
2010
102views more  BMCBI 2010»
13 years 7 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 8 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
SIAMCOMP
2011
13 years 2 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon