3356 search results - page 191 / 672 » Determining Consensus Numbers |
165
click to vote
DNA
2006
Springer
15 years 9 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
166
click to vote
ICCD
1995
IEEE
15 years 9 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
139
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Designing small-molecule kinase inhibitors with desirable selectivity profiles is a major challenge in drug discovery. A high-throughput screen for inhibitors of a giv...
167
click to vote
ML
2000
ACM
15 years 5 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
193
click to vote
ALGORITHMICA
2011
14 years 9 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...