Sciweavers

2043 search results - page 219 / 409
» Some Basics on Tolerances
Sort
View
ENTCS
2008
72views more  ENTCS 2008»
15 years 6 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
FUIN
2008
72views more  FUIN 2008»
15 years 6 months ago
Working with the Past: Integrating History in Petri Nets
Abstract. Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...
EOR
2006
65views more  EOR 2006»
15 years 6 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
IJIS
2008
42views more  IJIS 2008»
15 years 6 months ago
An efficient triplet-based algorithm for evidential reasoning
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computati...
Yaxin Bi
FUIN
2006
89views more  FUIN 2006»
15 years 6 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry