Sciweavers

4860 search results - page 278 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
125
Voted
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 6 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
112
Voted
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
14 years 10 months ago
Cooperative micro-particle swarm optimization
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
Konstantinos E. Parsopoulos
122
Voted
JCC
2006
110views more  JCC 2006»
15 years 20 days ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 28 days ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
106
Voted
BMCBI
2008
211views more  BMCBI 2008»
15 years 24 days ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen