1522 search results - page 14 / 305 » On the Complexity of Several Haplotyping Problems |
JSAT
2006
13 years 7 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
TON
2012
11 years 10 months ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
EOR
2010
13 years 7 months ago
2010
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
AIPS
2009
13 years 8 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...