output
20042009
most citedOptimal experimental design and some related control problems

245 citations

23 papers

cs.DM2009

Local negative circuits and fixed points in Boolean networks

Adrien Richard

To each Boolean function F from {0,1}^n to itself and each point x in {0,1}^n, we associate the signed directed graph G_F(x) of order n that contains a positive (resp. negative) ar…

math.AG20099 cited

On the typical rank of real binary forms

Pierre Comon, Giorgio Ottaviani

We determine the rank of a general real binary form of degree d=4 and d=5. In the case d=5, the possible values of the rank of such general forms are 3,4,5. The existence of three…

stat.ML20093 cited

Initialization Free Graph Based Clustering

Laurent Galluccio, Olivier J. J. Michel, Pierre Comon +2

This paper proposes an original approach to cluster multi-component data sets, including an estimation of the number of clusters. From the construction of a minimal spanning tree w…

cs.NE200820 cited

The Connectivity of NK Landscapes' Basins: A Network Analysis

Sébastien Verel, Gabriela Ochoa, Marco Tomassini

We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of…

cs.DM2008

Simulations between triangular and hexagonal number-conserving cellular automata

Katsunobu Imai, Bruno Martin

A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution.…

cs.SE20084 cited

Comparison between CPBPV, ESC/Java, CBMC, Blast, EUREKA and Why for Bounded Program Verification

Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck

This report describes experimental results for a set of benchmarks on program verification. It compares the capabilities of CPBVP "Constraint Programming framework for Bounded Prog…