Sciweavers

835 search results - page 35 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
13 years 6 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
EC
2000
241views ECommerce» more  EC 2000»
13 years 8 months ago
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
Mitchell A. Potter, Kenneth A. De Jong
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
14 years 3 days ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
ICEC
1996
123views more  ICEC 1996»
13 years 9 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
ICCAD
1999
IEEE
76views Hardware» more  ICCAD 1999»
14 years 23 days ago
Optimal allocation of carry-save-adders in arithmetic optimization
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
Junhyung Um, Taewhan Kim, C. L. Liu