The satisfiability(SAT) problem is a core problem of artificial intelligence. Research findings in SAT are widely used in many areas. The main methods solving SAT problem are resolution principle, tableau calculus and...
详细信息
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...
详细信息
Particle swarm optimization (PSO) algorithm is a robust and efficient approach for solving complex real-world problems. In this paper, a modified particle swarm algorithm (IMPSO) is introduced for unconstrained global...
详细信息
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...
详细信息
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...
详细信息
To represent and reason with interval-value information of applications in description logic, based on interval-fuzzy set the classical description logic *** is extended to the fuzzy description logic IFALCN. Its'...
详细信息
To represent and reason with interval-value information of applications in description logic, based on interval-fuzzy set the classical description logic *** is extended to the fuzzy description logic IFALCN. Its' syntax, semantics and fuzzy tableau algorithm are presented in detail. Our work enhances the expressiveness and reasoning ability of ALCN. IFALCN is the generalization of fuzzy ALCN based on single value and more expressive than the latter and can conform to human cognition better.
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...
详细信息
In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, an...
详细信息
In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, and queries are issued by mobile units (laptop, cell phone, etc.) which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicated. We show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach, called efficient distributed skyline based on mobile computing (EDS-MC). In EDS-MC, a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication, network delay and query response time. We conduct extensive experiments in a simulated mobile database system, and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.
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.
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.
暂无评论