Sciweavers

1012 search results - page 159 / 203
» Process Algebra with Backtracking
Sort
View
TCS
2010
13 years 3 months ago
A comparison of semantic models for noninterference
The literature on definitions of security based on causality-like notions such as noninterference has used several distinct semantic models for systems. Early work was based on st...
Ron van der Meyden, Chenyi Zhang
JMLR
2012
11 years 11 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
BIRTHDAY
2004
Springer
14 years 2 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 3 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 3 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...