681 search results - page 62 / 137 » General Polynomial Time Decomposition Algorithms |
89
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
97
Voted
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
92
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
115
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
90
Voted
RECOMB
2001
Springer
16 years 24 days ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...