Sciweavers

268 search results - page 11 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
SIGPRO
2008
106views more  SIGPRO 2008»
14 years 9 months ago
Propagator-based methods for recursive subspace model identification
The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Seve...
Guillaume Mercère, Laurent Bako, Sté...
AOSD
2010
ACM
15 years 4 months ago
Weaving generic programming and traversal performance
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...
Bryan Chadwick, Karl J. Lieberherr
TEC
2008
135views more  TEC 2008»
14 years 9 months ago
Quantum Genetic Optimization
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Andrea Malossini, Enrico Blanzieri, T. Calarco
RANDOM
2001
Springer
15 years 2 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
ECOOP
1998
Springer
15 years 1 months ago
Synthesizing Object-Oriented and Functional Design to Promote Re-Use
Many problems require recursively speci ed types ofdata and a collection of tools that operate on those data. Over time, these problems evolve so that the programmer must extend t...
Shriram Krishnamurthi, Matthias Felleisen, Daniel ...