105 search results - page 19 / 21 » A New Algorithm for Incremental Prime Implicate Generation |
BMCBI
2008
13 years 7 months ago
2008
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
DIS
2006
Springer
13 years 9 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
ECAI
1998
Springer
13 years 11 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...