摘要
This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
