Søk Bilder Maps Play YouTube Nyheter Gmail Disk Mer »
Logg på
Bøker Bok 14 av 4EF Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. on the Theory...
" EF Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959. "
Diagraphs: Theory, Algorithms and Applications - Side 707
av Jørgen Bang-Jensen, Gregory Gutin - 2002 - 754 sider
Begrenset visning - Om denne boken

Algorithms - ESA '94: Second Annual European Symposium, Utrecht, The ...

Jan Leeuwen, Jan van Leeuwen - 1994 - 510 sider
...1972. In Russian. 56. GJ Minty. Monotone Networks. Proc. Roy. Soc. London, A(257):194-212, 1960. 57. EF Moore. The Shortest Path Through a Maze. In Proc....Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959. 58. R. Motwani. Expanding Graphs and the Average-case Analysis of Algorithms...
Begrenset visning - Om denne boken

Network Optimization

Panos M. Pardalos, Donald W. Hearn, William W. Hager - 1997 - 488 sider
...and BN Livshits. Nelineinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian. 15. EF Moore. The Shortest Path Through a Maze. In Proc....Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959. 16. P. Van Emde Boas and R. Kaas and E. Zijlstra. Design and implementation...
Begrenset visning - Om denne boken

Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994

Sandeep Nautam Bhatt - 1997 - 162 sider
...ACM SIG CS Education Bulletin, 23(1), March 1991. [8] E. F. Moore, The shortest path through a maze. Proc. of the Int. Symp. on the Theory of Switching, pages 285-292, Harvard University Press, 1959. [9] G. Pantziou, P. Spirakis, and C. Zaroliagis, Efficient parallel...
Begrenset visning - Om denne boken

Computational Mathematics Driven by Industrial Problems: Lectures given at ...

R. Burkard, P. Deuflhard, A. Jameson, J.-L. Lions, G. Strang - 2000 - 426 sider
...An upper bound for the probability of a union. Journal of Aplied Probability 13, 1976, 597-603. [14] EF Moore, The shortest path through a maze. In Proc. of the Int. Symp. on the Theory of Switching, Harvard University Press, 1959, pp. 285-292. [15] R. Rado, Note on independence functions. Proceedings...
Begrenset visning - Om denne boken




  1. Mitt bibliotek
  2. Hjelp
  3. Avansert boksøk