Sciweavers

432 search results - page 7 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
13 years 8 months ago
A tree-based GA representation for the portfolio optimization problem
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
Claus de Castro Aranha, Hitoshi Iba
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
14 years 23 days ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
14 years 23 days ago
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
Andrew Lim, Brian Rodrigues, Fei Xiao
ICNSC
2008
IEEE
14 years 2 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi
ICTAI
1997
IEEE
13 years 11 months ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III