Sciweavers

884 search results - page 34 / 177
» Control structures in programs and computational complexity
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
ICALP
2005
Springer
14 years 1 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
HPCN
2000
Springer
13 years 11 months ago
Modelling Control Systems in an Event-Driven Coordination Language
The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures f...
Theophilos A. Limniotes, George A. Papadopoulos
ICCS
2005
Springer
14 years 1 months ago
Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations
Abstract. Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algeb...
Albert Hartono, Alexander Sibiryakov, Marcel Nooij...