Results 51 to 60 of about 31,249 (277)
A Survey on Teaching and Learning Recursive Programming
Informatics in Education, 2014 We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a ...
Christian RINDERKNECHT
doaj +1 more source
Heat Transfer, EarlyView.ABSTRACT This work presents and compares two explicit approaches for estimating space‐ and time‐dependent source terms in parabolic diffusion equations, derived from analytical solutions obtained through the Classical Integral Transform Technique (CITT).
André J. P. de Oliveira +5 more
wiley +1 more source
, 2008 International audienceWe give a recursion-theoretic characterization of the complexity classes NC k for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed ...
Marion, Jean-Yves +7 more
core +1 more source
Mise au Point, 2022 There are many representations of creativity in Michel Gondry's cinema. In fact, in a more or less explicit way, the director regularly stages characters who imagine objects or original solutions to understand their environment.
Camille Périssé
doaj +1 more source
Institutional Diversity in Banking and Economic Complexity
International Journal of Finance &Economics, EarlyView.ABSTRACT In this paper, we test whether institutional diversity in banking systems is beneficial to economic complexity, using data for Italian provinces in the period 1998–2017. We compute different indexes that consider diversity from an ownership, institutional, business model and competition point of view and find that higher diversity has a ...
Beniamino Pisicoli
wiley +1 more source
, 2018 \u3cp\u3eWe elaborate some key topics for a master class on recursion. In particular, we show how to do recursion in an object-oriented programming language that does not allow recursion.\u3c/p ...
Verhoeff, T.; id_orcid, Tom Verhoeff
core +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
Dasar-Dasar Pemrograman 2 - Recursion
, 2019 <p>Recursion is recursion.</p ...
Darari, Fariz
core +1 more source
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source
, 1989 Moschovakis (1984, in “Computation and Proof Theory” (Y. Richter et al., Eds.), Lect. Notes in Math. Vol. 1104, pp. 289–362, Springer-Verlag, Berlin) raised a question: to find a “logic of recursion,” related to “recursion structures” as denotational ...
Abrusci, V.Michele, Mascari, Gianfranco
core +1 more source