Constraint satisfaction problems play a significant role in the field of Artificial Intelligence. Reducing the search space can improve the efficiency of solving the problems before the search of solutions. Applying i...
详细信息
We have studied the AC-4 algorithm and then present key value ordering heuristic forming the new solving algorithm BT-KVV, which is based on the AC-4 algorithm. This algorithm takes full advantage of the state informa...
详细信息
We have studied the AC-4 algorithm and then present value ordering heuristic for solving algorithm BT-MSV which is based on the AC-4 algorithm. This algorithm takes full advantage of supported information which is rec...
详细信息
Focusing on the inversing operation of cardinal directions, the current generative method does not always work correctly. According to the given definitions of smallest rectangular direction and original directions, t...
详细信息
The major problem in developing a useful formalism for reasoning about spatial information is the trade off between expressive power and computational tractability. Based on Bennett's modal representation of conve...
详细信息
ISBN:
(纸本)9788988678299
The major problem in developing a useful formalism for reasoning about spatial information is the trade off between expressive power and computational tractability. Based on Bennett's modal representation of convex-hull and the RCC62 model which describes the topological relation between simple concave regions, the modal representation of RCC62 is presented in this paper, which has a theoretical advantage over 1st-order representations.
This paper introduces a qualitative spatial model based on previously developed models for representation and reasoning the spatial information described in natural language. The model is integrated with direction and...
详细信息
Because of restricted energy of the sensor nodes, the location error, costs of communication and computation should be considered in localization algorithms. The DV-Hop algorithm was detailedly analyzed and the main r...
详细信息
Because of restricted energy of the sensor nodes, the location error, costs of communication and computation should be considered in localization algorithms. The DV-Hop algorithm was detailedly analyzed and the main reasons for the error were pointed out, aiming at the different position anchor nodes' effect on location error, a novel localization algorithm called DV-Hop_Bon (DV-Hop based on optimal nodes) based on optimal nodes was put forward. Finally, it was simulated on Matlab, the results of the simulation show that the novel localization algorithm improves the localization precision with a short communication radius. Therefore it can be applied to wireless sensor networks widely.
This paper proposes a layered graph model for representing the internal structure of complex plane regions, where each node represents the closure of a connected component of the interior or exterior of a complex regi...
详细信息
lti-label learning aims at predicting a proper label set for each unseen *** instance in the dataset is associated with a set of predefined ***-label learning approaches frequently used choose identical feature set to...
lti-label learning aims at predicting a proper label set for each unseen *** instance in the dataset is associated with a set of predefined ***-label learning approaches frequently used choose identical feature set to determine the instance's membership of each label.
In order to realize that IPv6 (Internet Protocol version 6) clients are able to visit remote IPv6 servers through GPRS (General Packet Radio Service), we proposed a new and feasible framework. After discussing the lim...
详细信息
暂无评论