Sciweavers

1332 search results - page 193 / 267
» Combinatorial Algorithms
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
CEC
2009
IEEE
14 years 2 months ago
A multi-objective approach to Redundancy Allocation Problem in parallel-series systems
— The Redundancy Allocation Problem (RAP) is a kind of reliability optimization problems. It involves the selection of components with appropriate levels of redundancy or reliabi...
Zai Wang, Tianshi Chen, Ke Tang, Xin Yao
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 2 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
EMSOFT
2009
Springer
13 years 11 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
BMCBI
2010
154views more  BMCBI 2010»
13 years 8 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin