5263 search results - page 1042 / 1053 » Open Constraint Optimization |
101
click to vote
PR
2006
14 years 9 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
SIAMCOMP
2008
14 years 9 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
85
Voted
ANOR
2005
14 years 9 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
TCAD
2008
14 years 9 months ago
2008
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rate...
90
Voted
TCOM
2008
14 years 9 months ago
2008
We consider a point-to-point communication system in which data packets randomly arrive to a finite-length buffer and are subsequently transmitted to a receiver over a timevarying ...