Results 181 to 190 of about 54,626 (205)
Some of the next articles are maybe not open access.
Journal of Systems and Software, 2000
Abstract An experiment involving more than 500 responses from over 250 subjects was conducted for the purpose of identifying differences in debugging performance among subjects who debugged iterative code and those who debugged recursive code. The subjects, classified as novices or experienced, based on programming experience, were asked to locate ...
Alan C. Benander +2 more
openaire +1 more source
Abstract An experiment involving more than 500 responses from over 250 subjects was conducted for the purpose of identifying differences in debugging performance among subjects who debugged iterative code and those who debugged recursive code. The subjects, classified as novices or experienced, based on programming experience, were asked to locate ...
Alan C. Benander +2 more
openaire +1 more source
IEEE Transactions on Communications, 2018
Extensive studies have demonstrated the effectiveness and the flexibility of constructing capacity-approaching codes by block Markov superposition transmission (BMST). However, to achieve high performance, BMST codes typically require large encoding memories and large decoding window sizes, which result in high decoding complexity and high decoding ...
Shancheng Zhao +3 more
openaire +1 more source
Extensive studies have demonstrated the effectiveness and the flexibility of constructing capacity-approaching codes by block Markov superposition transmission (BMST). However, to achieve high performance, BMST codes typically require large encoding memories and large decoding window sizes, which result in high decoding complexity and high decoding ...
Shancheng Zhao +3 more
openaire +1 more source
Journal of Bioinformatics and Computational Biology, 2007
A multi-locus likelihood of a genetic map is computed based on a mathematical model of chromatid exchange in meiosis that accounts for any type of bivalent configuration in a genetic interval in any specified order of genetic markers. The computational problem is to calculate the likelihood (L) and maximize L by choosing an ordering of genetic markers ...
Susanta Tewari +2 more
openaire +2 more sources
A multi-locus likelihood of a genetic map is computed based on a mathematical model of chromatid exchange in meiosis that accounts for any type of bivalent configuration in a genetic interval in any specified order of genetic markers. The computational problem is to calculate the likelihood (L) and maximize L by choosing an ordering of genetic markers ...
Susanta Tewari +2 more
openaire +2 more sources
1979
In a recently published paper [4] the author described a new algorithm for multivariate polynomial factorization over the integers. One important feature of this algorithm is the variable-by-variable p-adic construction of all factors in parallel.
openaire +1 more source
In a recently published paper [4] the author described a new algorithm for multivariate polynomial factorization over the integers. One important feature of this algorithm is the variable-by-variable p-adic construction of all factors in parallel.
openaire +1 more source
A CAUSAL APPROACH TO THE CONSTRUCTION OF BIONIC CALCULATIONS BASED ON RECURSIVE DATA ANALYSIS MODELS
Systems Engineering and Information Technologies, 2022openaire +1 more source
Classical consequences of constructive systems
Philosophical Transactions Series A, Mathematical, Physical, and Engineering Sciences, 2023Joan Rand Moschovakis
exaly
Cryptographic Analysis and Construction of Complete Permutations using a Recursive Approach
International Journal of Ad Hoc and Ubiquitous ComputingShuang Xiang +3 more
openaire +1 more source
Generative recursive network for constructive solid geometry
Electronics Letters, 2019Yang Zhang
exaly