4117 search results - page 93 / 824 » On the Satisfiability of Complex Constraints |
153
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
156
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
152
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Combinatorial regulation of transcription factors (TFs) is important in determining the complex gene expression patterns particularly in higher organisms. Deciphering ...
165
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...