Results 51 to 60 of about 477 (109)
Density of truth in modal logics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 The aim of this paper is counting the probability that a random modal formula is a tautology. We examine $\{ \to,\Box \}$ fragment of two modal logics $\mathbf{S5}$ and $\mathbf{S4}$ over the language with one propositional variable.
Zofia Kostrzycka
doaj +1 more source
Microbiology, 2009 Secreted proteins play an important part in the pathogenicity of Mycobacterium tuberculosis, and are the primary source of vaccine and diagnostic candidates. A majority of these proteins are exported via the signal peptidase I-dependent pathway, and have
N. A. Leversen +5 more
semanticscholar +1 more source
Linear time recognition of P4-indifference graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has ...
Michel Habib +2 more
doaj +1 more source
Constructions for Clumps Statistics. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This object has first been studied by Schbath with the aim of counting the number of occurrences
Frédérique Bassino +3 more
doaj +1 more source
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
Explicit computation of the variance of the number of maxima in hypercubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a combinatorial approach of the variance for the number of maxima in hypercubes. This leads to an explicit expression, in terms of Multiple Zeta Values, of the dominant term in the asymptotic expansion of this variance.Moreover, we get an ...
Christian Costermans, Hoang Ngoc Minh
doaj +1 more source
Analysis of a new skip list variant [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 For a skip list variant, introduced by Cho and Sahni, we analyse what is the analogue of horizontal plus vertical search cost in the original skip list model.
Guy Louchard, Helmut Prodinger
doaj +1 more source
Properties of Random Graphs via Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise
Konstantinos Panagiotou, Andreas Weißl
doaj +1 more source
Patterns in Mainstream Programming Games
Int. J. Serious Games, 2020 Studies have found serious games to be good tools for programming education. As an outcome from such research, several game solutions for learning computer programming have appeared. Most of these games are only used in the research field where only
Ander Areizaga Blanco, H. Engström
semanticscholar +1 more source
Discrete Mathematics & Theoretical Computer Science, 2005 We consider the $\textit{master ring problem (MRP)}$ which often arises in optical network design. Given a network which consists of a collection of interconnected rings $R_1, \ldots, R_K$, with $n_1, \ldots, n_K$ distinct nodes, respectively, we need to
Hadas Shachnai, Lisa Zhang
doaj +1 more source