Sciweavers

473 search results - page 87 / 95
» Local Search in Unstructured Networks
Sort
View
DAC
2005
ACM
14 years 11 months ago
Partitioning-based approach to fast on-chip decap budgeting and minimization
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
Hang Li, Zhenyu Qi, Sheldon X.-D. Tan, Lifeng Wu, ...
ICML
1995
IEEE
15 years 10 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
15 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 4 months ago
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
A. E. Eiben, Marc Schoenauer, Juan Luís Jim...
ISNN
2007
Springer
15 years 4 months ago
Memetic Algorithms for Feature Selection on Microarray Data
In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods...
Zexuan Zhu, Yew-Soon Ong