19320 search results - page 3638 / 3864 » On the complexity of computing determinants |
153
click to vote
GECCO
2009
Springer
16 years 3 days ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
159
click to vote
ISEUD
2009
Springer
16 years 3 days ago
2009
Springer
All software today is written using libraries, toolkits, frameworks and other application programming interfaces (APIs). We performed a user study of the online documentation a lar...
134
click to vote
IWPEC
2009
Springer
16 years 3 days ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
189
click to vote
KSEM
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
147
click to vote
OOPSLA
2009
Springer
16 years 3 days ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...