Results 1 to 10 of about 672,480 (326)
Solomon Marcus Contributions to Theoretical Computer Science and Applications
Axioms, 2021 Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised ...
Cristian S. Calude, Gheorghe Păun
doaj +1 more source
Automata in SageMath---Combinatorics meet Theoretical Computer Science [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved ...
Clemens Heuberger +2 more
doaj +1 more source
Combining data and theory for derivable scientific discovery with AI-Descartes
Nature Communications, 2023 Scientists aim to discover meaningful formulae that accurately describe experimental data. Mathematical models of natural phenomena can be manually created from domain knowledge and fitted to data, or, in contrast, created automatically from large ...
Cristina Cornelio +8 more
doaj +1 more source
What Idea of Information Do ICT Practitioners Have in Mind?
Proceedings, 2022 We mean to reflect on the divide extant between theoretical studies on information and the knowledge of information shared by ICT (information and communication technologies) professionals.
Paolo Rocchi
doaj +1 more source
Balanced Avoidance Games on Random Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order.
Martin Marciniszyn +2 more
doaj +1 more source
A Probabilistic Counting Lemma for Complete Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke +2 more
doaj +1 more source
Special Issue on ‘Computer Science in Sport’
Applied Sciences, 2022 Computer Science in Sport is a cross-disciplinary topic that brings together the problem-solving capabilities of Computer Science to various theoretical and practical aspects of all sports and physical activities [...]
Christian Dawson
doaj +1 more source
Theoretical Design Science in Human–Computer Interaction: A Practical Concern?
Artifact, 2007 Design research, without empirical evaluation, is often looked upon as a poor relation to more obviously experimental work. A common reason to reject design studies submitted for publication concerns their failure to provide an empirical evaluation of ...
John M. Carroll
doaj +3 more sources
A solution to the learning dilemma for recurrent networks of spiking neurons
Nature Communications, 2020 Bellec et al. present a mathematically founded approximation for gradient descent training of recurrent neural networks without backwards propagation in time.
Guillaume Bellec +6 more
doaj +1 more source
Cycles intersecting edge-cuts of prescribed sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove that every cubic bridgeless graph $G$ contains a $2$-factor which intersects all (minimal) edge-cuts of size $3$ or $4$. This generalizes an earlier result of the authors, namely that such a $2$-factor exists provided that $G$ is planar.
Tomáš Kaiser, Riste Škrekovski
doaj +1 more source