Results 1  10
of
749,924
Monadic secondâ€“order evaluations on treedecomposable graphs
 Theoret. Comput. Sci
, 1993
"... Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs, ..."
Abstract

Cited by 90 (25 self)
 Add to MetaCart
Courcelle, B. and M. Mosbah, Monadic secondorder evaluations on treedecomposable graphs,
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 522 (16 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
Monads for functional programming
, 1995
"... The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondeterminism. Three case studies are looked at in detail: how monads ease the modification o ..."
Abstract

Cited by 1481 (39 self)
 Add to MetaCart
of a simple evaluator; how monads act as the basis of a datatype of arrays subject to inplace update; and how monads can be used to build parsers.
Diagnosing TreeDecomposable Circuits
, 1995
"... This paper describes a diagnosis algorithm called structurebased abduction (SAB) which was developed in the framework of constraint networks [ 12 ] . The algorithm exploits the structure of the constraint network and is most efficient for neartree problem domains. By analyzing the structure ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
This paper describes a diagnosis algorithm called structurebased abduction (SAB) which was developed in the framework of constraint networks [ 12 ] . The algorithm exploits the structure of the constraint network and is most efficient for neartree problem domains. By analyzing the structure
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model. 1 Introduction This paper is about logics for reasoning about programs, in particular for proving equivalence of programs. Following a consolidated tradition in theoretical computer science we identify programs with the closed terms, possibly containing extra constants, corresponding to some features of the programming language under consideration. There are three approaches to proving equivalence of programs: ffl T...
Problems easy for treedecomposable graphs
 J. of Algorithms
, 1991
"... Abstract. We describe the application of a Bayesian variablenumber samplepath (VNSP) optimization algorithm to yield a robust design for a floating sleeve antenna for hepatic microwave ablation. Finite element models are used to generate the electromagnetic (EM) field distribution in liver given a ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
of lesion size, shape and efficiency. Moreover, the Bayesian VNSP algorithm finds an optimal solution saving 41 % simulation of the evaluations compared to the standard samplepath optimization method.
Practical Algorithms for MSO ModelChecking on TreeDecomposable Graphs
, 2014
"... In this survey, we review practical algorithms for graphtheoretic problems that are expressible in monadic secondorder logic. Monadic secondorder (MSO) logic allows quantifications over unary relations (sets) and can be used to express a host of useful graph properties such as connectivity, cco ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this survey, we review practical algorithms for graphtheoretic problems that are expressible in monadic secondorder logic. Monadic secondorder (MSO) logic allows quantifications over unary relations (sets) and can be used to express a host of useful graph properties such as connectivity, c
The monadic secondorder logic of graphs I. Recognizable sets of Finite Graphs
 Information and Computation
, 1990
"... The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins ..."
Abstract

Cited by 298 (17 self)
 Add to MetaCart
The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
749,924