Sciweavers

2905 search results - page 341 / 581
» Formal Memetic Algorithms
Sort
View
JLP
2006
56views more  JLP 2006»
15 years 3 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
LISP
2008
104views more  LISP 2008»
15 years 3 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
FUIN
2007
123views more  FUIN 2007»
15 years 3 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
SAC
2006
ACM
15 years 3 months ago
Transformation of B specifications into UML class diagrams and state machines
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
Houda Fekih, Leila Jemni Ben Ayed, Stephan Merz
ACTA
2005
104views more  ACTA 2005»
15 years 3 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole