3204 search results - page 570 / 641 » The Alcuin Number of a Graph |
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
－ We propose a novel oscillation ring (OR) test architecture for testing interconnects in SoC. In addition to stuck-at and open faults, this scheme can detect delay faults and cr...
109
click to vote
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
111
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
127
Voted
AAAI
2010
15 years 2 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...