Related content

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

By Floréen Patrik   Kaski Petteri   Polishchuk Valentin   Suomela Jukka  

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 102-118

Springer Publishing Company

Access to resources Recommend Favorite

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

By Bertossi A.A.   Pinotti C.M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 8, 2002-08 ,pp. : 1314-1333

Academic Press

Access to resources Recommend Favorite

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm

By Besta Milos   Stomp Frank  

Formal Methods in System Design, Vol. 27, Iss. 1-2, 2005-09 ,pp. : 5-27

Springer Publishing Company

Access to resources Recommend Favorite

A complete algorithm for designing passive fences to orient parts

By Wiegley Jeff   Goldberg Ken   Peshkin Mike   Brokowski Mike  

Assembly Automation, Vol. 17, Iss. 2, 1997-02 ,pp. : 129-136

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Preference-based reinforcement learning: a formal framework and a policy iteration algorithm

By Fürnkranz Johannes   Hüllermeier Eyke   Cheng Weiwei   Park Sang-Hyeun  

Machine Learning, Vol. 89, Iss. 1-2, 2012-10 ,pp. : 123-156

Springer Publishing Company

Access to resources Recommend Favorite