An anytime assignment algorithm: From local task swapping to global optimality

ISSN： 0929-5593

Source： Autonomous Robots, Vol.35, Iss.4, 2013-11, pp. : 271-286

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An information global minimization algorithm using the local improvement technique

By Lera Daniela Sergeyev Yaroslav

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 99-112

Springer Publishing Company

Access to resources Recommend Favorite

From local to global consistency in temporal constraint networks

By Koubarakis M.

Theoretical Computer Science, Vol. 173, Iss. 1, 1997-02 ,pp. : 89-112

Elsevier

Access to resources Recommend Favorite

Task assignment heuristics for parallel and distributed CFD applications

By Lopez-Benitez Noe Djomehri M. Jahed Biswas Rupak

International Journal of Computational Science and Engineering, Vol. 3, Iss. 2, 2007-11 ,pp. : 155-165

Inderscience Publishers

Access to resources Recommend Favorite

On Choosing a Task Assignment Policy for a Distributed Server System

By Harchol-Balter M. Crovella M.E. Murta C.D.

Journal of Parallel and Distributed Computing, Vol. 59, Iss. 2, 1999-11 ,pp. : 204-228

Academic Press

Access to resources Recommend Favorite

Task assignment algorithms for two-type heterogeneous multiprocessors

By Raravi Gurulingesh Andersson Björn Nélis Vincent Bletsas Konstantinos

Real-Time Systems, Vol. 50, Iss. 1, 2014-01 ,pp. : 87-141

Springer Publishing Company

Access to resources Recommend Favorite