Sciweavers

3136 search results - page 373 / 628
» Genetic programming theory
Sort
View
ICALP
2003
Springer
15 years 11 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 6 months ago
A computer verified, monadic, functional implementation of the integral
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
Russell O'Connor, Bas Spitters
ENTCS
2010
105views more  ENTCS 2010»
15 years 6 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
CPHYSICS
2006
57views more  CPHYSICS 2006»
15 years 6 months ago
Generation of Clebsch-Gordan coefficients for the point and double groups
The theory of the point and double groups has been widely used in quantum physics to understand the structure and dynamical properties of molecules and solids. In order to constru...
K. Rykhlinskaya, S. Fritzsche
JDA
2008
88views more  JDA 2008»
15 years 6 months ago
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
Cristina Bazgan, Zsolt Tuza