17770 search results - page 207 / 3554 » A Generalization of Forward-Backward Algorithm |
145
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
139
click to vote
GMP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...
164
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
151
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
184
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
This paper presents a hybrid approach to detect source-code clones that combines evolutionary algorithms and clustering. A case-study is conducted on a small C++ code base. The pr...