Sciweavers

TCS
2008
13 years 11 months ago
Anisotropic diagrams: Labelle Shewchuk approach revisited
F. Labelle and J. Shewchuk [3] have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
TCS
2008
13 years 11 months ago
Computational self-assembly
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
Pierre-Louis Curien, Vincent Danos, Jean Krivine, ...
TCS
2008
13 years 11 months ago
On the decidability and complexity of the structural congruence for beta-binders
Beta-binders is a recent process calculus developed for modelling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a stru...
Alessandro Romanel, Corrado Priami
TCS
2008
13 years 11 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
TCS
2008
13 years 11 months ago
Abstract interpretation and types for systems biology
Interpretation and Types for Systems Biology Fran
François Fages, Sylvain Soliman
TCS
2008
13 years 11 months ago
Density elimination
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
Agata Ciabattoni, George Metcalfe
TCS
2008
13 years 11 months ago
Loop detection in term rewriting using the eliminating unfoldings
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
Étienne Payet
TCS
2008
13 years 11 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev