Results 1  10
of
1,309
A HigherOrder Graph Calculus for Autonomic Computing
 GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT. A CONFERENCE CELEBRATING MARTIN CHARLES GOLUMBIC'S 60TH BIRTHDAY (2008)
, 2008
"... In this paper, we present a highlevel formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper, we present a highlevel formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We argue that this formalism is suitable for modeling autonomic systems and briefly illustrate its expressivity for modeling properties of such systems.
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
of higherorder functions (the Icalculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence
Tensor Decompositions and Applications
 SIAM REVIEW
, 2009
"... This survey provides an overview of higherorder tensor decompositions, their applications, and available software. A tensor is a multidimensional or N way array. Decompositions of higherorder tensors (i.e., N way arrays with N â¥ 3) have applications in psychometrics, chemometrics, signal proce ..."
Abstract

Cited by 723 (18 self)
 Add to MetaCart
processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, etc. Two particular tensor decompositions can be considered to be higherorder extensions of the matrix singular value decompo
sition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 484 (8 self)
 Add to MetaCart
Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used
Robust Higher Order Potentials for Enforcing Label Consistency
, 2009
"... This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner. Our method is based on higher order conditional random fields and uses potentials defined on sets of pixels (image segments) generated using unsupervised segmentation ..."
Abstract

Cited by 259 (34 self)
 Add to MetaCart
This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner. Our method is based on higher order conditional random fields and uses potentials defined on sets of pixels (image segments) generated using unsupervised segmentation
A HigherOrder Duration Calculus
 Millenial Perspectives in Computer Science. Proceedings of the 1999 OxfordMicrosoft Symposium in Honour of Professor Sir Anthony Hoare, Palgrave
, 1999
"... Calculus (DC) which can specify realtime requirements of computing system. This paper investigates how realtime behaviour of programs can be described within this logical framework. In order to describe local variable declaration, quantifications over program variables are inevitable, and therefor ..."
Abstract

Cited by 33 (9 self)
 Add to MetaCart
, and therefore a higherorder DC is established in the paper. This higherorder DC has a complete proof system, if we assume finite variability of program variables. Zhou Chaochen is the Director of UNU/IIST, on leave of absence from the Software Institute, the Chinese Academy of Sciences, where he is a Professor
A Calculus of Mobile Processes, Part I
 I AND II. INFORMATION AND COMPUTATION
, 1989
"... We present the ßcalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 219 (4 self)
 Add to MetaCart
into the ß calculus of higherorder functions (the calculus and combinatory algebra), the tr...
Completeness of HigherOrder Duration Calculus
 UNU/IIST Report No.175, UNU/IIST, International Institute for Software Technology, P.O. Box 3058
, 1999
"... In order to describe the realtime behaviours of programs in terms of Duration Calculus, proposed by Zhou Chaochen, C.A.R. Hoare and A.P. Ravn in [5], which can specify realtime requirements of computing systems, quantifications over program variables are inevitable, e.g. to describe local variable ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
variable declaration, to declare local channel and so on. So a higherorder duration calculus (abbreviated HDC) is established in [2]. This paper proves the completeness of HDC on abstract domains by encoding HDC to first order twosorted interval temporal logic. This idea is hinted by [13]. All results
Higherorder narrowing with definitional trees
 Neural Computation
, 1996
"... Functional logic languages with a sound and complete operational semantics are mainly based on narrowing. Due to the huge search space of simple narrowing, steadily improved narrowing strategies have been developed in the past. Needed narrowing is currently the best narrowing strategy for firstord ..."
Abstract

Cited by 78 (23 self)
 Add to MetaCart
functional logic programs due to its optimality properties w.r.t. the length of derivations and the number of computed solutions. In this paper, we extend the needed narrowing strategy to higherorder functions and λterms as data structures. By the use of definitional trees, our strategy computes only
Results 1  10
of
1,309