Etude asympotique d'une marche aléatoire centrifuge

A paraître dans les Annales de l'IHPInternational audienceThe centrifugal random walk is a Markov process in the Euclidean space whose transition probabilities are those of an ordinary symemetric random walk perturbated by a centrifugal drift. We study the behaviour of this process in the mean, in law and on individual trajectories when times goes to infinity

Towards an algorithmic theory of adaptation

AbstractWe study, with the help of chaitin's algorithmic theory of information, the survival of an autonomous automatic system in a drastically simplified world. Despite our abstract animal has only to recognize its food, it cannot avoid errors without the help of an unreasonably large memory. So the continuous integration of new informations, implying the elimination of obsolete ones, is the only way to compute a correct behavior on a realizable machine

Tseitin's formulas revisited

AbstractG being a graph, we define its cyclomatic cohesion γ(G). Then, using Tseitin's method (1970), we construct a contradictory formula C(G) and prove our main theorem: Every resolution of C(G) contains, at least, 2γ(G) distinct clauses. A similar result was obtained by Urquhart (1987) with a different method valid only for a specific family of graphs

Sur la resolution du probleme de satisfiabilite

SIGLEINIST T 75175 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Meta-resolution: An algorithmic formalisation

AbstractWe study the Tseitin formulae (Tseitin, 1970) on which resolution is known to be inefficient. We first give a new proof of the satisfiability condition and precise the number of solutions if any and otherwise the minimal contradictory subformula. Then, defining a new data structure, we introduce the meta-argument of that proof in the Davis-Putnam and Loveland procedure (Loveland, 1978) and obtain a new algorithm for SAT especially efficient on these formulae

Continuous Learning in a Behavioral Animation

International audienc