On the Motion Planning Problem, Complexity, Entropy, and Nonholonomic Interpolation

By Gauthier Jean-Paul  

Journal of Dynamical and Control Systems, Vol. 12, Iss. 3, 2006-07 ,pp. : 371-404

Springer Publishing Company

Access to resources Recommend Favorite

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

By Qiu Jiaming   Sharkey Thomas  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1201-1212

Springer Publishing Company

Access to resources Recommend Favorite

Detecting and repairing anomalous evolutions in noisy environments: Logic programming formalization and complexity results

By Angiulli Fabrizio   Greco Gianluigi   Palopoli Luigi  

Annals of Mathematics and Artificial Intelligence, Vol. 60, Iss. 3-4, 2010-12 ,pp. : 179-228

Springer Publishing Company

Access to resources Recommend Favorite

Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 63, Iss. 4, 2014-07 ,pp. : 306-326

John Wiley & Sons Inc

Access to resources Recommend Favorite

On algorithm complexity

By Kudryavtsev V.   Andreev A.  

Journal of Mathematical Sciences, Vol. 168, Iss. 1, 2010-07 ,pp. : 89-122

Springer Publishing Company

Access to resources Recommend Favorite