The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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 in preprocessing step, arc consistency technique can remove some values which are arc inconsistent, so that it can reduce the search space. Using heuristic strategies can improve the efficiency...
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 recorded in the data structure of the AC-4 algorithm during the process of arc consistency. The algorithm sorts the value of the variables' domain according to the supported information...
Constraint Satisfaction Problem is an important branch of Artificial Intelligence, one typical algorithm to solve Constraint Satisfaction Problem is the searching algorithm based on backtracking. The Dynamic Backtracking algorithm proposed by Ginsberg in 1993 is an efficient algorithm which uses backtracking integrates with constraint propagation. Now, according to the basic idea of dynamic backtracking,...
In order to Solve the problem of cooperation in MAS(multi-agent system), it is a familiar idea to built up a system by logic. We consider the cooperation in a dynamic environment, and then present a dynamic coalition logic (DCL) system. Furthermore, we define the steps for coalition formation. Finally, we compare DCL with other coalition logic.
In order to make the constraint algorithm more efficient, the processing of constraint propagation is analyzed, and parameterized description of the arc consistency propagation depth is represented by using variable domain retraction proportion. And then an arc consistency algorithm is proposed whose propagation degree is controllable, the constraint algorithmpsilas efficiency is studied under different...
Multi-agent cooperation logic gained great research interest in multi-agent systems community in the last five years. In this paper, general concurrent game structures are developed based on extending concurrent game structures. By introducing three kinds of belief operators into ATL (Alternating-time temporal logic), a new multi-agent cooperation logic named ATBL (alternating-time temporal belief...
Based on the artificial immune system, a new clonal selection algorithm is proposed to perform global optimization. The concept of classified mutation is defined and the dynamic adjustment methods of some evolution parameters are introduced. The proposed algorithm is applied to several benchmark problems, and its performance is compared with other approaches in the literature. The results indicate...
Based on clonal selection principle, a novel evolutionary algorithm encoded in floating-point-number is proposed to solve function optimization problems. A micro-mutation operator and an elitism-guided crossover operator are defined respectively for the best and medium antibodies. The main features of the algorithm are combination of meticulous local with double-quick global search, and automatic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.