Výsledky vyhledávání - [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC]

Non-Determinism and Nash Equilibria for Sequential Game over Partial Order Autor Le Roux, Stéphane

“…In sequential games of traditional game theory, backward induction guarantees existence of Nash equilibrium by yielding a sub-game perfect equilibrium. But if…”
Získat plný text

Algebraic Elimination of epsilon-transitions Autor Gérard Duchamp, Hatem Hadj Kacem, Eric Laugerotte

“…We present here algebraic formulas associating a k-automaton to a k-epsilon-automaton. The existence depends on the definition of the star of matrices and of…”
Získat plný text

Classical Combinatory Logic Autor Nour, Karim

“…Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and…”
Získat plný text

Undecidable problems concerning densities of languages Autor Kozik, Jakub

“…In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no…”
Získat plný text

Solving equations over small unary algebras Autor Broniek, Przemyslaw

“…We consider the problem of solving a system of polynomial equations over fixed algebra $A$ which we call MPolSat($A$). We restrict ourselves to unary algebras…”
Získat plný text

The call-by-value λµ∧∨-calculus Autor Nour, Karim, Saber, Khelifa

“…In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an…”
Získat plný text

Random Boolean expressions Autor Gardy, Danièle

“… Analytic tools give us a systematic way to prove the existence of probability distributions, the main challenge being the actual computation of the distributions…”
Získat plný text

On-line coloring of $I_s$-free graphs Autor Cieslik, Iwona, Kozik, Marcin, Micek, Piotr

“…An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the…”
Získat plný text

On-line Adaptive Chain Covering of Upgrowing Posets Autor Bosek, Bartłomiej, Micek, Piotr

“…We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time…”
Získat plný text