4860 search results - page 15 / 972 » SNPs Problems, Complexity, and Algorithms |
107
click to vote
COCO
1995
Springer
15 years 3 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
106
click to vote
JACM
2010
14 years 10 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
CSB
2005
IEEE
15 years 5 months ago
2005
IEEE
Raising seeds for biological experiments is prone to error; a careful experimenter will test in the lab to verify that plants are of the intended strain. Choosing a minimal set of...
121
click to vote
ISAAC
1993
Springer
15 years 3 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...