828 search results - page 83 / 166 » Bounded Hairpin Completion |
103
click to vote
IPCO
1998
15 years 2 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
106
click to vote
APN
2010
Springer
15 years 27 days ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
103
Voted
AMAI
2005
Springer
15 years 18 days ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
JPDC
2007
15 years 17 days ago
2007
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
101
click to vote
CPC
2004
15 years 16 days ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...