Sciweavers

14548 search results - page 237 / 2910
» The Optimal Path-Matching Problem
Sort
View
108
Voted
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 6 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
108
Voted
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 3 months ago
Solving constrained multi-objective problems by objective space analysis
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Gideon Avigad, Carlos A. Coello Coello
AMC
2005
136views more  AMC 2005»
15 years 2 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
123
Voted
IPPS
2007
IEEE
15 years 8 months ago
A Resource Allocation Problem in Replicated Peer-to-Peer Storage Systems
This paper focuses on peer-to-peer storage systems that achieve availability through replication. We study the problem of resource allocation when the system must replicate multip...
Sriram Ramabhadran, Joseph Pasquale
ORL
2008
93views more  ORL 2008»
15 years 2 months ago
Polymatroids and mean-risk minimization in discrete optimization
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
Alper Atamtürk, Vishnu Narayanan