 | Ipke Wachsmuth, Claus Rollinger, Wilfried Brauer - 1995 - 275 pàgines
...Memory-Bounded Search Methods, in: Proceedings ECAI92, Vienna, Austria (1992), 1-5. [SB89] Sen, AK, Bagchi, A., Fast Recursive Formulations for Best-First Search...that Allow Controlled Use of Memory, in: Proceedings IJCAI-89, Detroit, MI (1989), 297-302. Quality-Based Terminological Reasoning for Concept Learning... | |
 | Panos M. Pardalos - 1999 - 235 pàgines
...iterative-deepening search by controlling cutoff bounds, Artificial Intelligence, Vol. 50, pp. 207-221, 1991. [36] AK SEN AND A. BAGCHI, Fast recursive formulations...best-first search that allow controlled use of memory, Proceedings llth Int'l Joint Conf. on Artificial Intelligence (IJCAI-89), pp. 297-302, Detroit, MI,... | |
 | J. C. Misra - 2003 - 516 pàgines
...by controlling cutoff bounds. Artificial Intelligence 50(1991),207-221. 25. Sen, AK and Bagchi, A., Fast Recursive Formulations for Best-First Search that allow controlled use of memory, In proc. of IJCAI-89, 297-302, 1989. Appendix: Upperbounds for D g , D& Dp and I) 0 In this section we... | |
| |