127 search results - page 13 / 26 » Some Parameterized Problems On Digraphs |
WG
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
PDCN
2004
13 years 8 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
FCT
2005
Springer
14 years 27 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
DAM
2006
13 years 7 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...