2398 search results - page 412 / 480 » Constraint Programming and Graph Algorithms |
133
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...
144
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
117
click to vote
ICCAD
2005
IEEE
15 years 11 months ago
2005
IEEE
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
136
Voted
IPCO
2004
15 years 3 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
129
click to vote
STOC
2004
ACM
15 years 7 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...