Sciweavers

1529 search results - page 31 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
13 years 12 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
TLCA
2007
Springer
14 years 1 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
CEC
2010
IEEE
13 years 5 months ago
EDDIE for investment opportunities forecasting: Extending the search space of the GP
Abstract-- In this paper we present a new version of a GPbased financial forecasting tool called EDDIE. The novelty of this new version (EDDIE 8), is its enlarged search space, whe...
Michael Kampouridis, Edward Tsang
ICEC
1994
68views more  ICEC 1994»
13 years 9 months ago
Extended Forking Genetic Algorithm for Order Representation (O-FGA)
There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We've already proposed a new type of binar...
Shigeyoshi Tsutsui, Yoshiji Fujimoto, Isao Hayashi