738 search results - page 65 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
DLOG
2004
14 years 11 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
CAD
2007
Springer
14 years 9 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
PADS
2004
ACM
15 years 3 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communicat...