1071 search results - page 18 / 215 » Theories of Automatic Structures and Their Complexity |
105
click to vote
SARA
2000
Springer
15 years 7 months ago
2000
Springer
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
138
click to vote
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
116
click to vote
CG
2004
Springer
15 years 4 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
119
click to vote
KBSE
2008
IEEE
15 years 10 months ago
2008
IEEE
—Automatic white-box test generation is a challenging problem. Many existing tools rely on complex code analyses and heuristics. As a result, structural features of an input prog...
123
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
15 years 11 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...