17760 search results - page 173 / 3552 » A Generalization of the Massey-Ding Algorithm |
137
Voted
FOCS
1997
IEEE
15 years 8 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...
118
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
139
click to vote
GECCO
2005
Springer
15 years 9 months 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...
128
click to vote
ACMSE
2005
ACM
15 years 9 months ago
2005
ACM
an extended abstract for a poster that presents a new approach that employs metaprogramming to generate optimized code for algorithms in Linear Algebra. Categories and Subject Des...
135
Voted
AAAI
2006
15 years 5 months ago
2006
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...