The satisfiability problem is the core problem in artificial intellgence. The algorithm directional resolution(DR) is a well known method based on resolution for satisfiability problem. But the number of clauses has g...
详细信息
The satisfiability problem is the core problem in artificial intellgence. The algorithm directional resolution(DR) is a well known method based on resolution for satisfiability problem. But the number of clauses has great impact on the efficiency of the method. In this paper, an algorithm SRDR is proposed to solve the problem. SRDR is based on algorithm DR and splitting rule. By using splitting rule, the number of clauses can be reduced obviously. Furthermore, the strategy MO is designed for SRDR. With the strategy, we can get a better order of variables and the efficiency of SRDR is improved. The experimental data shows that SRDR is more efficient that DR.
For the optimization problem about triangulation of Bayesian networks, a novel genetic algorithm, DHGA, is proposed in this paper. DHGA employs a heuristic-based mutation operation. Moreover, it uses population divers...
详细信息
ISBN:
(纸本)9781424476718
For the optimization problem about triangulation of Bayesian networks, a novel genetic algorithm, DHGA, is proposed in this paper. DHGA employs a heuristic-based mutation operation. Moreover, it uses population diversity to identify stagnation and convergence as well as to guide the search procedure. Experiments on representative benchmarks show that DHGA posses better performance and robustness than other swarm intelligence methods.
In recent years, with the development of the wireless sensor networks, the localization method receives the attention of many researchers. However, due to the network cost and characteristics of sensor nodes, most of ...
详细信息
In recent years, with the development of the wireless sensor networks, the localization method receives the attention of many researchers. However, due to the network cost and characteristics of sensor nodes, most of the localization algorithms are not well suitable for the wireless sensor network, positioning error is relatively large. Based on the regular moving anchor node and RSSI ranging technique assisting positioning, in this paper, we proposed the RMADV-Hop (Regular Moving Anchor DV-Hop) localization algorithm to improve the DV-Hop algorithm. In the same network condition, we simulated these two localization algorithms using the omnet++ simulation software. Simulation results show that RMADV-Hop algorithm uses less anchor nodes than the DV-Hop algorithm, reduces the cost of network hardware, approximately achieves the evenly distribution of anchor nodes, and can get higher positioning accuracy than the DV-Hop algorithm in the randomly distributed network.
Due to the structuring and semi-structuring of the most data contained in deep web, it's considerably much easier to extract and construct the ontology. The constructed ontology has multiple appliances, such as th...
详细信息
To find an optimal elimination ordering for Bayesian networks, a multi-heuristic-based ant colony system named MHC-HS-ACS is proposed. MHC-HS-ACS uses a set of heuristics to guide the ants to search solutions. The heu...
详细信息
According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are prop...
详细信息
In this paper, a hybrid algorithm named DPSO-SA is proposed to find near-to-optimal elimination orderings in Bayesian networks. DPSO-SA is a discrete particle swarm optimization method enhanced by simulated annealing....
详细信息
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...
详细信息
ISBN:
(纸本)9781424458219;9781424458240
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 extension rule. Besides methods mentioned above, we find that the SAT problem can be solved with hitting set algorithms. If a set of clause is satisfiable, there must be a hitting set of the clause set which containing no complementary pairs of literals. Algorithm NEYVHS-tree is an efficient hitting set algorithm proposed by Ouyang. RNHST proposed in this paper is a revised algorithm in respect of ***-tree. It judges the satisfiability of a clause set by confirming the existence of the set's hitting set without complementary pairs of literals. The test result shows that RNHST is an efficient algorithm.
Currently, the research for the extraction of information in deep web is pretty active. Although many researchers already adopted ontology in the data extraction, many problems still exist. This paper proposed an onto...
详细信息
Automatic image segmentation remains a challenging problem in the fields of computer vision, image analysis and understanding. A lot of algorithms and technologies have been proposed and developed for image segmentati...
详细信息
暂无评论