Entity

Time filter

Source Type


Margenstern M.,CNRS Theoretical and Applied Informatics
Theoretical Computer Science | Year: 2011

In this paper, we construct a new weakly universal cellular automaton on the ternary heptagrid. This significantly improves the previous result, obtained by the same author in the same grid with six states. This time, the number of states is four. This is the best result up to date for cellular automata in the hyperbolic plane, with true planar motions. © 2010 Elsevier B.V. All rights reserved.


Le Thi H.A.,CNRS Theoretical and Applied Informatics | Dinh T.P.,Bp08 Avenue Of Luniversite | Van Ngai H.,University of Quynhon
Journal of Global Optimization | Year: 2012

In the present paper, we are concerned with conditions ensuring the exact penalty for nonconvex programming. Firstly, we consider problems with concave objective and constraints. Secondly, we establish various results on error bounds for systems of DC inequalities and exact penalty, with/without error bounds, in DC programming. They permit to recast several class of difficult nonconvex programs into suitable DC programs to be tackled by the efficient DCA. © Springer Science+Business Media, LLC. 2011.


Grange A.,CNRS Theoretical and Applied Informatics
IHM'10 - 22nd Conference Francophone sur l'Interaction Homme-Machine | Year: 2010

ChewingWord is a cross-platform on-screen keyboard for people with motor impairments and/or speech disorders, their care assistants, dyslexics and beginning readers. We focus on its interface, which aims to minimize the cognitive overload inherent to dynamic virtual keyboards, while preserving their main benefits: speed, power and fluidity.


Margenstern M.,CNRS Theoretical and Applied Informatics
Journal of Cellular Automata | Year: 2016

In this paper, we construct a weakly universal cellular automaton with two states only on the tiling {11, 3}. The cellular automaton is rotation invariant and it is a true planar one. © 2016 Old City Publishing, Inc.


Margenstern M.,CNRS Theoretical and Applied Informatics
Fundamenta Informaticae | Year: 2015

In this paper, our results on algorithmic analysis of tiling in hyperbolic spaces are discussed. We overview results and developments obtained by the approach, focusing on the construction of universal cellular automata in hyperbolic spaces with a minimal number of cell states.

Discover hidden collaborations