All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9 Next

Displaying 161 – 180 of 193

Showing per page

Domain mu-calculus

Guo-Qiang Zhang (2010)

RAIRO - Theoretical Informatics and Applications

The basic framework of domain μ-calculus was formulated in [39] more than ten years ago. This paper provides an improved formulation of a fragment of the μ-calculus without function space or powerdomain constructions, and studies some open problems related to this μ-calculus such as decidability and expressive power. A class of language equations is introduced for encoding μ-formulas in order to derive results related to decidability and expressive power of non-trivial fragments of the domain...

Domain-Free λµ-Calculus

Ken-Etsu Fujita (2010)

RAIRO - Theoretical Informatics and Applications

We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-style. Our motivation comes from the observation that in Curry-style polymorphic calculi, control operators such as callcc-operators cannot, in general, handle correctly the terms placed on the control operator's left, so that the Curry-style system can fail to prove the subject reduction property. Following the continuation semantics, we also discuss the notion of values in classical system,...

Domination Game: Extremal Families for the 3/5-Conjecture for Forests

Michael A. Henning, Christian Löwenstein (2017)

Discussiones Mathematicae Graph Theory

In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...

Drunken man infinite words complexity

Marion Le Gonidec (2008)

RAIRO - Theoretical Informatics and Applications

In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to n(log2n)2 when n goes to infinity.


Dual meaning of verbal quantities

Milan Mareš, Radko Mesiar (2002)

Kybernetika

The aim of the paper is to summarize and interpret some ideas regarding effective processing of vague data. The main contribution of the submitted approach consists in respecting the fact that vague data can be decomposed into two parts. The numerical one, describing the quantitative value of such data, and the semantic one characterizing the qualitative structure of the vagueness included into them. This partition of vague verbal data leads to a significant simplification of their practical processing,...

Dynamic estimation of evidence discounting rates based on information credibility

M. C. Florea, A.-L. Jousselme, É. Bossé (2010)

RAIRO - Operations Research

Information quality is crucial to any information fusion system as combining unreliable or partially credible pieces of information may lead to erroneous results. In this paper, Dempster-Shafer theory of evidence is being used as a framework for representing and combining uncertain pieces of information. We propose a method of dynamic estimation of evidence discounting rates based on the credibility of pieces of information. The credibility of a piece of information Cre(In) is evaluated through...

Dynamic gridmaps: comparing building techniques.

José María Cañas, Vicente Matellán (2006)

Mathware and Soft Computing

Mobile robots need to represent obstacles in their surroundings, even moving ones, to make right movement decisions. For higher autonomy the robot should automatically build such representation from its sensory input. This paper compares the dynamic character of several gridmap building techniques: probabilistic, fuzzy, theory of evidence and histogramic. Two criteria are defined to rank such dynamism in the representation: time to show a new obstacle and time to show a new hole. The update rules...

Currently displaying 161 – 180 of 193