Sciweavers

1142 search results - page 162 / 229
» Set Variables and Local Search
Sort
View
144
Voted
EVOW
2007
Springer
15 years 6 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
104
Voted
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
15 years 6 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 6 months ago
Hybrid Genetic Algorithms for Multi-Objective Optimisation of Water Distribution Networks
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...
Ed Keedwell, Soon-Thiam Khu
98
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
Design and Scalability of NLS, a Scalable Naming and Location Service
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...
Y. Charlie Hu, Daniel Rodney, Peter Druschel
AUTONOMICS
2008
ACM
15 years 2 months ago
R-P2P: a data centric DTN middleware with interconnected throwboxes
In this paper we describe R-P2P, a novel system meant to support the search and retrieval of data in a given area. RP2P couples opportunistic wireless communications between mobil...
Francesco De Pellegrini, Iacopo Carreras, Daniele ...