To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...