2899 search results - page 223 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
156
click to vote
CEC
2007
IEEE
16 years 29 days ago
2007
IEEE
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
176
click to vote
DCOSS
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
136
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
222
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
128
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...