Dijkstra

Results: 449



#Item
51A Pre-Programming Introduction to Algorithmics Judith Gal-Ezer1 The Open University of Israel,

A Pre-Programming Introduction to Algorithmics Judith Gal-Ezer1 The Open University of Israel,

Add to Reading List

Source URL: www.openu.ac.il

Language: English - Date: 2004-09-27 01:20:03
52Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu Prasun Sinha

Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu Prasun Sinha

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2009-12-22 15:26:50
53Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
54Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
55CSTA K–12 Computer Science Standards Revised 2011

CSTA K–12 Computer Science Standards Revised 2011

Add to Reading List

Source URL: c.ymcdn.com

Language: English - Date: 2016-02-04 20:38:44
56Social Networks–96  The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Social Networks–96 The accuracy of small world chains in social networks Peter D. Killworth a,∗ , Christopher McCarty b , H. Russell Bernard c , Mark House b

Add to Reading List

Source URL: nersp.nerdc.ufl.edu

Language: English - Date: 2007-06-20 07:27:56
57Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
58Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2  IIT Delhi, India,

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
59Microsoft Word - musicExplorerLab.doc

Microsoft Word - musicExplorerLab.doc

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:37:03
60An Introduction to Online and O ine Partial Evaluation Using a Simple Flowchart Language John Hatcli ? Department of Computing and Information Sciences Kansas State University

An Introduction to Online and O ine Partial Evaluation Using a Simple Flowchart Language John Hatcli ? Department of Computing and Information Sciences Kansas State University

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2010-10-22 08:05:17