885 search results - page 14 / 177 » Optimal Polygon Placement |
TPDS
2010
13 years 7 months ago
2010
—Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strat...
ALENEX
2007
13 years 10 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
ICMCS
1995
IEEE
14 years 5 days ago
1995
IEEE
The immensity of the datatransfer requirements of multimediaobjects will require multimediaservers tobe foundedon disk arrays. To effectively utilize a disk array, and hence to ma...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
Abstract— Regular structures are present in many types of circuits. If this structure can be identified and utilized, performance can be improved dramatically. In this paper, we...