Sciweavers

6943 search results - page 602 / 1389
» Representations for evolutionary algorithms
Sort
View
163
Voted
AAAI
2010
15 years 8 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
195
Voted
NAACL
2007
15 years 8 months ago
Clustered Sub-Matrix Singular Value Decomposition
This paper presents an alternative algorithm based on the singular value decomposition (SVD) that creates vector representation for linguistic units with reduced dimensionality. T...
Fang Huang, Yorick Wilks
204
Voted
DAM
2007
105views more  DAM 2007»
15 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
210
Voted
GECCO
1999
Springer
111views Optimization» more  GECCO 1999»
15 years 11 months ago
Evolving a behavior-based control architecture- From simulations to the real world
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
Marc Ebner, Andreas Zell
FCCM
1999
IEEE
210views VLSI» more  FCCM 1999»
15 years 11 months ago
Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
Eric K. Pauer, Paul D. Fiore, John M. Smith