668 search results - page 54 / 134 » Algorithmics and Applications of Tree and Graph Searching |
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
116
click to vote
DAC
2005
ACM
16 years 3 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
130
Voted
CP
2000
Springer
15 years 6 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
106
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
112
click to vote
3DIM
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...