1972 search results - page 332 / 395 » Evolutionary algorithms and dynamic programming |
149
click to vote
INFFUS
2008
15 years 5 months ago
2008
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
134
Voted
JGAA
2006
15 years 5 months ago
2006
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
174
click to vote
BIBE
2008
IEEE
15 years 11 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
144
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
211
Voted
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...