1421 search results - page 204 / 285 » Satisfying KBO Constraints |
174
click to vote
TCS
2008
15 years 6 months ago
2008
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
153
click to vote
TOG
2008
15 years 6 months ago
2008
This paper presents a new quadrangulation algorithm, extending the spectral surface quadrangulation approach where the coarse quadrangular structure is derived from the Morse-Smal...
186
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
155
click to vote
TVLSI
2008
15 years 6 months ago
2008
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
145
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...