Sciweavers

1155 search results - page 155 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
114
Voted
CSUR
2004
91views more  CSUR 2004»
15 years 2 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
92
Voted
IWMM
2000
Springer
84views Hardware» more  IWMM 2000»
15 years 6 months ago
Designing a Trace Format for Heap Allocation Events
Dynamic storage allocation continues to play an important role in the performance and correctness of systems ranging from user productivity software to high-performance servers. W...
Trishul M. Chilimbi, Richard E. Jones, Benjamin G....
127
Voted
ICNP
2007
IEEE
15 years 9 months ago
A Simple Model for Analyzing P2P Streaming Protocols
— P2P streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well u...
Yipeng Zhou, Dah-Ming Chiu, John C. S. Lui
109
Voted
COR
2008
122views more  COR 2008»
15 years 2 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
164
Voted
TEC
2002
183views more  TEC 2002»
15 years 2 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy