1376 search results - page 101 / 276 » Searching Trees: An Essay |
166
click to vote
ALGORITHMS
2010
15 years 3 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
215
click to vote
PVLDB
2010
15 years 1 months ago
2010
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
154
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
160
click to vote
TCAD
2002
15 years 6 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
238
click to vote
JDCTA
2010
15 years 1 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...