2137 search results - page 235 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
199
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
204
click to vote
ISPD
2012
ACM
14 years 1 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
170
Voted
DIALM
1999
ACM
15 years 10 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
187
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
179
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...