Sciweavers

1399 search results - page 243 / 280
» Multi-party Finite Computations
Sort
View
ENTCS
2006
155views more  ENTCS 2006»
13 years 8 months ago
Biomolecular Agents as Multi-behavioural Concurrent Objects
In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-ca...
Denys Duchier, Céline Kuttler
FS
2006
84views more  FS 2006»
13 years 8 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
IANDC
2006
97views more  IANDC 2006»
13 years 8 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
JBI
2008
13 years 8 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas