Sciweavers

4860 search results - page 265 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
91
Voted
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 6 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
94
Voted
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 22 days ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
ASUNAM
2011
IEEE
14 years 19 days ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...
92
Voted
PODC
2009
ACM
16 years 1 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
114
Voted
CEC
2009
IEEE
15 years 7 months ago
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
Hai-lin Liu, Xueqiang Li