Sciweavers

454 search results - page 57 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 1 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
BMCBI
2006
116views more  BMCBI 2006»
15 years 1 months ago
Gene annotation and network inference by phylogenetic profiling
Background: Phylogenetic analysis is emerging as one of the most informative computational methods for the annotation of genes and identification of evolutionary modules of functi...
Jie Wu, Zhenjun Hu, Charles DeLisi
ISICA
2007
Springer
15 years 7 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang
IMC
2006
ACM
15 years 7 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 2 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...