In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...
Mobile infrastructure consists of one or more sensors in a fixed configuration on a mobile platform. By moving the mobile platform in the environment and attaching a set of stat...
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi, Isao ...