Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Peter Růžička (1981)
Kybernetika
Similarity:
Alexander Barkalov, Larysa Titarenko, Sławomir Chmielewski (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
Optimization methods of logic circuits for Moore finite-state machines are proposed. These methods are based on the existence of pseudoequivalent states of a Moore finite-state machine, a wide fan-in of PAL macrocells and free resources of embedded memory blocks. The methods are oriented to hypothetical VLSI microcircuits based on the CPLD technology and containing PAL macrocells and embedded memory blocks. The conditions of effective application of each proposed method are shown. An...
Agnieszka Węgrzyn, Andrei Karatkevich, Jacek Bieganowski (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
A new method of detecting deadlocks and traps in Petri nets is presented. Deadlocks and traps in Petri nets can be represented by the roots of special equations in CNF form. Such equations can be solved by using the search tree algorithm proposed by Thelen. In order to decrease the tree size and to accelerate the computations, some heuristics for Thelen's method are presented.
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
Adam Meissner (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning....
Josef Kolář (1981)
Kybernetika
Similarity: