Sciweavers

5169 search results - page 707 / 1034
» Locality approximation using time
Sort
View
CCGRID
2002
IEEE
15 years 10 months ago
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
Peer-to-peer computing and networking, an emerging model of communication and computation, has recently started to gain significant acceptance. This model not only enables client...
Evangelos P. Markatos
BMCV
2000
Springer
15 years 9 months ago
A New Line Segment Grouping Method for Finding Globally Optimal Line Segments
In this paper we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantage...
Jeong-Hun Jang, Ki-Sang Hong
140
Voted
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 9 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
117
Voted
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 8 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
138
Voted
SIGMETRICS
1991
ACM
15 years 8 months ago
Implementing Stack Simulation for Highly-Associative Memories
Prior to this work, all implementations of stack simulation [MGS70] required more than linear time to process an address trace. In particular these implementations are often slow ...
Yul H. Kim, Mark D. Hill, David A. Wood