Results 11  20
of
77
Solving NPcomplete problems with networks of evolutionary processors
 Proceedings of IWANN 2001, LNCS 2084, SpringerVerlag
, 2001
"... We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NPcomplete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher direction ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
(Show Context)
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An NPcomplete problem is solved by networks of evolutionary processors of linear size in linear time. Some furher directions of research are finally discussed.
Emergent Computation by Catalytic Reactions
, 1996
"... Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used as part of the emergent computation paradigm in Computer Science. We review in this contribution the i ..."
Abstract

Cited by 23 (14 self)
 Add to MetaCart
Recently, biochemical systems have been shown to possess interesting computational properties. In a parallel development, the chemical computation metaphor is becoming more and more frequently used as part of the emergent computation paradigm in Computer Science. We review in this contribution the idea behind the chemical computational metaphor and outline its relevance for nanotechnology. We set up a simulated reaction system of mathematical objects and examine its dynamics by computer experiments. Typical problems of computer science, like sorting, parity checking or prime number computation are placed within this context. The implications of this approach for nanotechnology, parallel computers based on molecular devices and DNARNAprotein information processing are discussed. 1 Introduction The idea of using natural systems for computational purposes has long been pondered. Haken, for instance, has proposed to use laser mode competition as a way to recognize patterns [1]. Others h...
Constraint Simplification Rules
, 1992
"... In current constraint logic programming systems, constraint solving is hardwired in a "black box". We are investigating the use of logic programs to define and implement constraint solvers 1 . The representation of constraint evaluation in the same formalism as the rest of the program g ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
(Show Context)
In current constraint logic programming systems, constraint solving is hardwired in a "black box". We are investigating the use of logic programs to define and implement constraint solvers 1 . The representation of constraint evaluation in the same formalism as the rest of the program greatly facilitates the prototyping, extension, specialization and combination of constraint solvers. In our approach, constraints are specified by definite clauses provided by a host language, while constraint evaluation is specified using multiheaded guarded clauses called constraint simplification rules (SiRs) 2 . SiRs define determinate conditional rewrite systems that express how conjunctions of constraints simplify. They have been used to encode a range of constraint solvers in our prototype implementation. Additionally, the definite clauses specifying a constraint can be evaluated in the host language, if the constraint is "callable" and no SiR can simplify it further. In this way our appr...
Towards a Compositional Method for Coordinating Gamma Programs
 in Proc. Coordination'96 Conference
, 1996
"... With the growing complexity of software, incurred by the widespread acceptance of parallel and distributed computer systems and networks, program design would benefit from clearly separating the correctness issues (the computation) from efficiency issues (the coordination). Gamma has shown to be a p ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
With the growing complexity of software, incurred by the widespread acceptance of parallel and distributed computer systems and networks, program design would benefit from clearly separating the correctness issues (the computation) from efficiency issues (the coordination). Gamma has shown to be a powerful and expressive programming model that allows the basic computations of a program to be expressed with a minimum of control. This enables the programmer to defer efficiency related decisions until a second stage in the design process. In support of this second activity we introduce in this paper a coordination language that exploits the highly nondeterministic behaviour of Gamma to impose additional control. Furthermore, we propose a compositional notion of refinement that can be used to reason about coordination of Gamma programs. This notion induces a number of refinement laws that can be used in an algebraic style of reasoning. Some examples are presented to illustrate application ...
Topological collections, transformations and their application to the modeling and the simulation of dynamical systems
 In: Rewriting Technics and Applications (RTA’03), LNCS, vol. LNCS 2706
, 2003
"... I take the opportunity given by this invited talk to promote two ideas: (1) a topological point of view can fertilize the notion of rewriting and (2) this topological approach of rewriting is at the core of the modeling and the simulation of an emerging class of dynamical systems (DS): the DS that ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
I take the opportunity given by this invited talk to promote two ideas: (1) a topological point of view can fertilize the notion of rewriting and (2) this topological approach of rewriting is at the core of the modeling and the simulation of an emerging class of dynamical systems (DS): the DS that exhibit a dynamical
Gamma And The Chemical Reaction Model
, 1996
"... Gamma was originally proposed in 1986 as a formalism for the definition of programs without artificial sequentiality. The basic idea underlying the formalism is to describe computation as a form of chemical reaction on a collection of individual pieces of data. Due to the very minimal nature of the ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Gamma was originally proposed in 1986 as a formalism for the definition of programs without artificial sequentiality. The basic idea underlying the formalism is to describe computation as a form of chemical reaction on a collection of individual pieces of data. Due to the very minimal nature of the language, and its absence of sequential bias, it has been possible to exploit this initial paradigm in various directions. This paper reviews most of the work done by various groups along these lines and the current perspectives of our own research on Gamma. For the sake of clarity we separate the contributions in three categories: (1) the relevance of the chemical reaction model for software engineering, (2) extensions of the original model and (3) implementation issues. Keywords: implicit parallelism, correctness proof, specification, program derivation, termination, abstract machine
Coordination Languages for Parallel Programming
 Parallel Computing
, 1998
"... this article we will identify some basic principles of coordination languages, describe some examples, and introduce the rest of the papers in this special issue. 2 Basic Principles ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
this article we will identify some basic principles of coordination languages, describe some examples, and introduce the rest of the papers in this special issue. 2 Basic Principles
Static Analysis of Linear Logic Programming
 NEW GENERATION COMPUTING
, 1997
"... Linear Logic is gaining momentum in computer science because it offers a unified framework and a common vocabulary for studying and analyzing different aspects of programming and computation. We focus here on models where computation is identified with proof search in the sequent system of Linear ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Linear Logic is gaining momentum in computer science because it offers a unified framework and a common vocabulary for studying and analyzing different aspects of programming and computation. We focus here on models where computation is identified with proof search in the sequent system of Linear Logic. A proof normalization procedure, called "focusing", has been proposed to make the problem of proof search tractable. Correspondingly,
True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication
 In Proc. of TAPSOFT'93, volume 668 of Lecture Notes in Computer Science
, 1993
"... We define a true concurrency semantics for LO, a reactive programming language characterized by dynamically reconfigurable agents (processes), with interagent communication implemented as broadcasting and logical operators corresponding to Linear Logic connectives. Our semantic model is given by t ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
We define a true concurrency semantics for LO, a reactive programming language characterized by dynamically reconfigurable agents (processes), with interagent communication implemented as broadcasting and logical operators corresponding to Linear Logic connectives. Our semantic model is given by the wellknown Chemical Abstract Machine formalism, where concurrent events happen in the form of chemicallike reactions.