2137 search results - page 293 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
125
click to vote
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
163
click to vote
ALGORITHMICA
2000
15 years 4 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
149
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
131
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
322
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...