14699 search results - page 2692 / 2940 » Complexity and Cognitive Computing |
138
click to vote
GECCO
2009
Springer
15 years 11 months 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...
146
click to vote
ISEUD
2009
Springer
15 years 11 months 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...
116
click to vote
IWPEC
2009
Springer
15 years 11 months 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...
175
click to vote
KSEM
2009
Springer
15 years 11 months 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...
124
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...