106 articles – 48 Notices  [english version]
.:. Consultation > Liste par domaine > Informatique .:.
138 documents classés par :
Première Page Page Précédente 1 - 2 - 3 - 4 - 5 - 6 - 7 ... Page Suivante Page Finale
fulltext access Translating partitioned cellular automata into classical type cellular automata
Poupet V.
Dans Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" - JAC 2008, France (2008) [hal-00273994 - version 1]
fulltext access Tilings and model theory
Ballier A., Jeandel E.
Dans Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" - JAC 2008, France (2008) [hal-00273698 - version 1]
fulltext access Universalities in cellular automata; a (short) survey
Ollinger N.
[hal-00271840 - version 1] (10/04/2008)
fulltext access Periodicity and Immortality in Reversible Computing
Kari J., Ollinger N.
[hal-00270815 - version 1] (2008-04-07)
A Feasibility Pump for mixed integer nonlinear programs
Bonami P., Cornuéjols G., Lodi A., Margot F.
Mathematical Programming, Series A 119, 2 (2008) 331-352 [hal-00421755 - version 1]
fulltext access Apprentissage de SVM sur Données Bruitées
Stempfel G., Ralaivola L., Denis F.
[hal-00256503 - version 1] (15/02/2008)
fulltext access A compact topology for sand automata
Dennunzio A., Guillon P., Masson B.
[hal-00259945 - version 1] (29/02/2008)
fulltext access Structural aspects of tilings
Ballier A., Durand B., Jeandel E.
Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, France (2008) [hal-00145800 - version 2]
fulltext access Limit complexities revisited
Bienvenu L., Muchnik A., Shen A., Vereshchagin N.
In Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, France (2008) [hal-00218279 - version 1]
fulltext access Two-by-two Substitution Systems and the Undecidability of the Domino Problem
Ollinger N.
[hal-00204625 - version 2] (03/03/2008)
fulltext access A Polynomial Algorithm for the Inference of Context Free Languages
Clark A., Eyraud R., Habrard A.
Dans Proceeding of the 9th International Colloquium on Grammatical Inference, ICGI 2008 - 9th International Colloquium on Grammatical Inference - ICGI 2008, France (2008) [hal-00348673 - version 1]
Local terminations and distributed computability in anonymous networks
Chalopin J., Godard E., Métivier Y.
Dans Distributed computing - International symposium on distributed computing (DISC), France (2008) [hal-00332759 - version 1]
fulltext access Finding a Minimum Medial Axis of a Discrete Shape is NP-hard
Coeurjolly D., Hulin J., Sivignon I.
Theoretical Computer Science 206, 1-2 (2008) 72-79 [hal-00332406 - version 1]
fulltext access Relevant Representations for the Inference of Rational Stochastic Tree Languages
Denis F., Gilbert E., Habrard A., Ouardi F., Tommasi M.
Dans Proceedings of the 9th International Colloquium on Grammatical Inference - International Colloquium on Grammatical Inference, France (2008) [hal-00293511 - version 3]
fulltext access Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
Charbit P., Jeandel E., Koiran P., Perifel S., Thomassé S.
Journal of Complexity 24 (2008) 39-53 [lirmm-00292703 - version 1]