A comparison of heuristic best-first algorithms for bicriterion shortest path problems. (English)
Eur. J. Oper. Res. 217, No. 1, 44-53 (2012).
1
Heuristic search of cut-off points for clinical parameters: defining the limits of obesity. (English)
Batyrshin, Ildar (ed.) et al., Advances in artificial intelligence. 10th Mexican international conference on artificial intelligence, MICAI 2011, Puebla, Mexico, November 26‒December 4, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-25323-2/pbk). Lecture Notes in Computer Science 7094. Lecture Notes in Artificial Intelligence, 560-571 (2011).
2
Hybrid tasks model of NC system and its optimal scheduling algorithm. (Chinese)
J. Zhejiang Univ., Eng. Sci. 40, No. 8, 1315-1319 (2006).
3
Parallel randomized best-first minimax search. (English)
Artif. Intell. 137, No. 1-2, 165-196 (2002).
4
A dynamic list heuristic for 2D-cutting. (English)
Doležal, Jaroslav et al., System modelling and optimization. Proceedings of the 17th IFIP TC7 conference. Prague, Czech Republic, July 10‒14, 1995. London: Chapman \& Hall. 481-488 (1996).
5
Linear-space best-first search. (English)
Artif. Intell. 62, No.1, 41-78 (1993).
6
The comparison between the statistical heuristic search and $A\sp*$. (English)
J. Comput. Sci. Technol. 4, No.2, 126-132 (1989).
7
Problemlösen durch heuristische Suche in der Artifical Intelligence. (Problem solving by heuristic search in artificial intelligence). (German)
Wien etc.: Springer-Verlag. XIII, 231 S.; DM 98.00; öS 686.00 (1988).
8
Generalized best-first search strategies and the optimality of $A\sp *$. (English)
J. Assoc. Comput. Mach. 32, 505-536 (1985).
9
Start
Contact
Print
General Help
