Sciweavers

122 search results - page 14 / 25
» Evolutionary Search for Matrix Multiplication Algorithms
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 1 days ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ESCIENCE
2006
IEEE
15 years 5 months ago
Niching for Population-Based Ant Colony Optimization
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
Daniel Angus
BMCBI
2006
159views more  BMCBI 2006»
14 years 11 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
127
Voted
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 5 months ago
A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio
One of the most critical issues that remains to be fully addressed in existing multimodal evolutionary algorithms is the difficulty in pre-specifying parameters used for estimatin...
Xiaodong Li
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 3 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack