610 search results - page 73 / 122 » Using SAT in QBF |
104
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
— This paper presents a parameter domain pruning method. Parameter domain pruning aims to identify parameter sub-domains that are more likely to produce feasible and good design ...
125
click to vote
CCCG
2003
15 years 5 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
107
click to vote
FUIN
2008
15 years 4 months ago
2008
In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided re...
ENGL
2007
15 years 4 months ago
2007
—We present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse. Also we show the utility of an automatic demonstrator ...
148
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...