Sciweavers

960 search results - page 131 / 192
» Optimal Monte Carlo Algorithms
Sort
View
GECCO
2004
Springer
244views Optimization» more  GECCO 2004»
15 years 9 months ago
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
Gregorio Toscano Pulido, Carlos A. Coello Coello
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 4 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 10 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
15 years 7 months ago
Design synthesis of microelectromechanical systems using genetic algorithms with component-based genotype representation
An automated design synthesis system based on a multi-objective genetic algorithm (MOGA) has been developed for the optimization of surface-micromachined MEMS devices. A hierarchi...
Ying Zhang, Raffi R. Kamalian, Alice M. Agogino, C...
SAC
2010
ACM
15 years 11 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato