Results 61 to 70 of about 1,576,475 (325)
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
Multi-Agent Systems for Computational Economics and Finance [PDF]
In this article we survey the main research topics of our group at the University of Essex. Our research interests lie at the intersection of theoretical computer science, artificial intelligence, and economic theory. In particular, we focus on the design and analysis of mechanisms for systems involving multiple strategic agents, both from a ...
arxiv +1 more source
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 +3 more sources
A short proof that adding some permutation rules to $β$ preserves $SN$ [PDF]
I show that, if a term is $SN$ for $\beta$, it remains $SN$ when some permutation rules are added.
arxiv +1 more source
Typed Operational Semantics for Dependent Record Types [PDF]
Typed operational semantics is a method developed by H. Goguen to prove meta-theoretic properties of type systems. This paper studies the metatheory of a type system with dependent record types, using the approach of typed operational semantics. In particular, the metatheoretical properties we have proved include strong normalisation, Church-Rosser and
arxiv +1 more source
The number of {1243, 2134}-avoiding permutations [PDF]
We show that the counting sequence for permutations avoiding both of the (classical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences.
arxiv +1 more source
Solving constraint satisfaction problems with networks of spiking neurons
Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes) areemitted sparsely by neurons to signal the occurrence of an event at a particular ...
Zeno eJonke+2 more
doaj +1 more source
On the Descriptive Complexity of Color Coding
Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
Permutations avoiding 4321 and 3241 have an algebraic generating function [PDF]
We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic generating function conjectured by Vladimir Kruchinin.
arxiv +1 more source
In this study, we compared three methods for kinship identification using different algorithms in samples of wild Pacific bluefin tuna and generated genotyping data. The three methods resulted in different numbers of inferred kinship pairs for both generated and actual data. Particularly for the half‐sibling pairs, considerable number of false‐positive
Yohei Tsukahara+5 more
wiley +1 more source