Computing Expected Runtimes for Constant Probability Programs [PDF]
, 2019 We introduce the class of constant probability (CP) programs and show that classical results from probability theory directly yield a simple decision procedure for (positive) almost sure termination of programs in this class. Moreover, asymptotically tight bounds on their expected runtime can always be computed easily.
Jürgen Giesl, Peter Giesl, Marcel Hark
openaire +2 more sources
Explaining IT programming concepts using NSM explications: The case of ‘variable’ and ‘constant’
LingBaW, 2019 The paper seeks to explore a practical application of Natural Semantic Metalanguage in defining two core concepts in computer programming, i.e. the concept of a variable and the concept of a constant.
Bartłomiej Biegajło
doaj +1 more source
Automated Assessment of Computer Programming Practices: The 8-Years UNED Experience
IEEE Access, 2019 The increasing popularity of distance education poses exciting new challenges. In particular, current pedagogical paradigms, such as competency-based education, require students' continuous evaluation.
Daniel Galan +4 more
doaj +1 more source
Model Checking Linear Logic Specifications [PDF]
, 2003 The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications.
Bozzano, M., Delzanno, G., Martelli, M.
core +1 more source
Key Concepts, Weakness and Benchmark on Hash Table Data Structures
Algorithms, 2022 Most computer programs or applications need fast data structures. The performance of a data structure is necessarily influenced by the complexity of its common operations; thus, any data-structure that exhibits a theoretical complexity of amortized ...
Santiago Tapia-Fernández +2 more
doaj +1 more source
Component-based simulation for a reconfiguration study of transitic systems [PDF]
, 2004 This paper is organized as follows. Part A presents the context of reconfiguring transitic systems and the main idea in implementing the decision step. It comprises sections 1 to 3. Section 3 presents an example that illustrates the concepts presented in
Berruet, Pascal +2 more
core +5 more sources
Computational Intelligence in Marine Control Engineering Education
Polish Maritime Research, 2021 This paper presents a new approach to the existing training of marine control engineering professionals using artificial intelligence. We use optimisation strategies, neural networks and game theory to support optimal, safe ship control by applying the ...
Lisowski Józef
doaj +1 more source
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space [PDF]
, 2020 A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivity problems parameterized by treewidth can be solved much faster than the previously best known time ?^*(2^{?(twlog tw)}). Using their inspired Cut&Count technique, they obtained ?^*(
Hegerfeld, Falko, Kratsch, Stefan
core +2 more sources
OPT-RNN-DBSVM: OPTimal Recurrent Neural Network and Density-Based Support Vector Machine
Mathematics, 2023 When implementing SVMs, two major problems are encountered: (a) the number of local minima of dual-SVM increases exponentially with the number of samples and (b) the computer storage memory required for a regular quadratic programming solver increases ...
Karim El Moutaouakil +4 more
doaj +1 more source
Research OF Complex Processes Based on Step-By-Step Modeling
Nauka ta progres transportu, 2021 Purpose. When solving practical problems that require the creation and further analysis of the model, an important criterion is the labour intensity of modeling.
O. V. Horbova, N. S. Murkovych
doaj +1 more source