Sciweavers

3958 search results - page 347 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
16 years 28 days ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
216
Voted
IPPS
2008
IEEE
16 years 1 months ago
DC-SIMD : Dynamic communication for SIMD processors
SIMD (single instruction multiple data)-type processors have been found very efficient in image processing applications, because their repetitive structure is able to exploit the...
Raymond Frijns, Hamed Fatemi, Bart Mesman, Henk Co...
EVOW
2005
Springer
16 years 8 days ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
Juan José Pantrigo, Abraham Duarte, Á...
GECCO
2005
Springer
134views Optimization» more  GECCO 2005»
16 years 8 days ago
Tracking extrema in dynamic environments using a coevolutionary agent-based model of genotype edition
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
Chien-Feng Huang, Luis Mateus Rocha
DAC
2002
ACM
16 years 7 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...