14642 search results - page 182 / 2929 » It's Time for a Change |
187
click to vote
FMCAD
2004
Springer
15 years 10 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
182
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
159
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
118
click to vote
AML
2007
15 years 6 months ago
2007
We provide an exposition of supercompact Radin forcing and present several methods for iterating Radin forcing. In this paper we give an exposition of supercompact Radin forcing us...
173
click to vote
JCM
2008
15 years 6 months ago
2008
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the perf...