نتایج جستجو برای: multi valued lempel zivcomplexity

تعداد نتایج: 501831  

Journal: :British Journal of Mathematics & Computer Science 2014

2002
Robert K. Brayton M. Gao Jie-Hong Roland Jiang Yunjian Jiang Yinghua Li Alan Mishchenko Subarnarekha Sinha Tiziano Villa

A program called MVSIS has been developed which optimizes multi-level multi-valued networks (MV networks). We describe what such a network is and the capabilities contained in MVSIS. MVSIS is modeled after SIS, which synthesizes binary multi-level networks, but the logic network of MVSIS is such that all variables can be multivalued each with its own range. Included in MVSIS are almost all the ...

2007
R. Banks L. J. Steggles Richard Banks L. Jason Steggles

To understand the function of genetic regulatory networks in the development of cellular systems, we must not only realise the individual network entities, but also the manner by which they interact. Multi-valued networks are a promising qualitative approach for modelling such genetic regulatory networks, providing an interesting compromise between the simplicity of Boolean models and more deta...

2007
A. D. WALLACE

When ƒ is single-valued we know that continuity is equivalent to the assertion that A, B closed imply f (A), f~(B) closed. When ƒ is multi-valued we take this as a definition of continuity. I t does not follow, as in the single-valued case, that f~~(B) is open if B is open. These definitions include both a single-valued map ( = continuous function) and its inverse. In this note we show that cer...

Journal: :Information & Computation 2023

This paper expands upon existing and introduces new formulations of Bennett's logical depth. In previously published work by Jordon Moser, notions finite-state-depth pushdown-depth were examined compared. These based on finite-state transducers information lossless pushdown compressors respectively. Unfortunately a full separation between the two was not established. formulation restricting how...

2014
Lei Zhang Chong-Jun Wang Junyuan Xie

Landmark based heuristics are among the most accurate current known admissible heuristics for cost optimal planning. Disjunctive action landmarks can be considered as at-least-one constraints on the actions they contains. In many planning domains, there are many critical propositions which have to be established for a number of times. Previous landmarks fail to express this kind of general card...

2005
Georgios E. Fainekos

Nowadays computer systems have become ubiquitous. Most of the resources in the development of such systems, and especially in the fail-safe ones, are allocated into the simulation and verification of their behavior. One such automated method of verification is model checking. Given a mathematical description of the real system and a specification usually in the form of temporal logics, a model ...

Journal: :IEEE Trans. Information Theory 1997
Gusztáv Morvai Sidney J. Yakowitz Paul H. Algoet

The conditional distribution of the next outcome given the infinite past of a stationary process can be inferred from finite but growing segments of the past. Several schemes are known for constructing pointwise consistent estimates, but they all demand prohibitive amounts of input data. In this paper we consider real-valued time series and construct conditional distribution estimates that make...

Journal: :Journal of Communication and Information Systems 1997

2006
Katarzyna Budzyńska Magdalena Kacprzak

The objective of our paper is to investigate the possibilities of a logical representation for argumentation executed in multi-agent systems. We concentrate particularly on belief’s uncertainty and revision that an agent deals with throughout the process of discussion. Moreover, we propose a formalism based on a multi-valued logic that allows for specification of properties of multi-agent syste...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید