13376 search results - page 86 / 2676 » Problem Solving with |
83
Voted
TVLSI
2008
15 years 20 days ago
2008
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
110
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
114
click to vote
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
91
Voted
MOC
2000
15 years 17 days ago
2000
The iteratively regularized Gauss-Newton method is applied to compute the stable solutions to nonlinear ill-posed problems F (x) = y when the data y is given approximately by y wit...
125
Voted
EWSN
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...