Results 31 to 40 of about 672,480 (326)
The Price of Connectivity for Vertex Cover [PDF]
Graph ...
Eglantine Camby +3 more
doaj +1 more source
Incremental Construction of Motorcycle Graphs
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast.
Franz Aurenhammer +2 more
doaj +1 more source
Normal Functions as a New Way of Defining Computable Functions [PDF]
Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way.
Leszek Dubiel
doaj
Generating Turing Machines by Use of Other Computation Models [PDF]
For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human.
Leszek Dubiel
doaj
Engaging Equity Pedagogies in Computer Science Learning Environments
In this position paper, we advocate for the use of equity-focused teaching and learning as an essential practice within computer science classrooms. We provide an overview of the theoretical underpinnings of various equity pedagogies (Banks & Banks, 1995)
Tia c. Madkins +2 more
semanticscholar +1 more source
Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes [PDF]
The combinatorial optimization is aimed at finding the optimum sequence for a given form of the performance index. This paper deals with the problems of combinatorics optimization.
Wieslaw Wajs
doaj
A Model of Fast Hebbian Spike Latency Normalization
Hebbian changes of excitatory synapses are driven by and enhance correlations between pre- and postsynaptic neuronal activations, forming a positive feedback loop that can lead to instability in simulated neural networks.
Hafsteinn Einarsson +4 more
doaj +1 more source
The hippocampus is known to play a crucial role in the formation of long-term memory. For this, fast replays of previously experienced activities during sleep or after reward experiences are believed to be crucial.
Marcelo Matheus Gauy +6 more
doaj +1 more source
Theoretical Computer Science in Italy
Stefano Bistarelli Guest Editor stefano.bistarelli@unipg.it Andrea Formisano Guest Editor andrea.formisano@unipg.it Dipartimento di Matematica e Informatica, Università di Perugia, Perugia, Italy Dipartimento di Matematica e Informatica Università di Perugia Perugia Italy The Italian Conference on Theoretical Computer Science is the traditional ...
BISTARELLI, Stefano, FORMISANO, Andrea
openaire +3 more sources
Coding in theoretical computer science [PDF]
This thesis contains three topics, list decoding of rank-metric codes, local decoding of Reed-Muller codes and the design of tampering detection codes and its generalization non-malleable codes. The first two topics are the central problems in theoretical computer science and the last one has cryptographic background. They are all focused on the design
openaire +2 more sources

