New complexity results on scheduling problem in a robotic cell

By Chikhi Nacira   Abbas Moncef   Benmansour Rachid   Hanafi Saïd  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-08 ,pp. : 749-762

Edp Sciences

Access to resources Recommend Favorite

Computing the prefix of an automaton

By Béal Marie-Pierre   Carton Olivier  

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 6, 2010-03 ,pp. : 503-514

Edp Sciences

Access to resources Recommend Favorite

Modified Anaerobic Digestion Test Produces Reliable Results with Decreased Experimental Complexity

By Boero V. J.   Chowning G. L.   Willis J. L   Shaw T. M.  

Proceedings of the Water Environment Federation, Vol. 2008, Iss. 3, 2008-01 ,pp. : 37-56

Water Environment Federation

Access to resources Recommend Favorite

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

By Darties Benoit   Giroudeau Rodolphe   König Jean-Claude   Simonin Gilles  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 781-795

Edp Sciences

Access to resources Recommend Favorite

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

By Bollig Beate  

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 1, 2010-03 ,pp. : 51-66

Edp Sciences

Access to resources Recommend Favorite