Dijkstra - PDFSEARCH.IO - Document Search Engine

Dijkstra
Results: 449

#	Item
31	UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/13/23 Add to Reading List Source URL: www.dcs.bbk.ac.uk Language: English - Date: 2014-01-19 15:11:19 Software engineering Computer programming Theoretical computer science Edsger W. Dijkstra Predicate transformer semantics IP NP Recursion
32	Community-Aware Mobile Networking Michael Kuhn Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:47 Mathematics Graph theory Network theory Discrete mathematics Edsger W. Dijkstra Graph Shortest path problem Topological graph theory Isomap
33	Let tests drive or let Dijkstra derive? Presented at ALE2014 in Krakow Poland on August 21, 2014 Author: Sander Kooijmans Date: November 3, 2014 Why this document? Add to Reading List Source URL: www.gogognome.nl Language: English - Date: 2016-04-05 02:15:07 Formal methods Theoretical computer science Software engineering Mathematics Hoare logic Static program analysis Algorithm Precondition Predicate transformer semantics Loop invariant
34	Prof. Roger Wattenhofer http://www.dcg.ethz.ch Semester/Master Thesis Distributed Graph Coloring Motivation and Informal Description Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:37:01 Graph theory Mathematics Theoretical computer science NP-complete problems Distributed computing Symposium on Principles of Distributed Computing ACM SIGACT Graph coloring Algorithm Independent set Dijkstra Prize Symposium on Parallelism in Algorithms and Architectures
35	A Note on Monitor Versions Essay in the Honour of C.A.R. Hoare Ole-Johan Dahl Department of Informatics University of Oslo, Norway 30th July 1999 Add to Reading List Source URL: www.olejohandahl.info Language: English - Date: 2013-09-23 13:44:35 Software engineering Computing Programming language theory Concurrency control Edsger W. Dijkstra Monitor Formal methods Hoare logic Event Semaphore Concurrent computing Pascal
36	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem
37	PDF Document Add to Reading List Source URL: web.cse.ohio-state.edu Language: English - Date: 2011-05-20 18:09:33 Mathematics Mathematical analysis Network theory Mathematical optimization Edsger W. Dijkstra Operations research Shortest path problem Differential geometry of curves Linear programming Backpressure routing Transportation theory
38	A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:23 Graph theory Mathematics Network theory Edsger W. Dijkstra Shortest path problem Graph Planar separator theorem Graph coloring
39	On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch Add to Reading List Source URL: webdb2011.rutgers.edu Language: English - Date: 2011-05-31 18:17:42 Computational complexity theory Mathematics Edsger W. Dijkstra Graph theory Algorithm Mathematical logic Theoretical computer science Shortest path problem NP Dynamic programming
40	Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer} Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:15:52 Graph theory Mathematics NP-complete problems Edsger W. Dijkstra Routing algorithms Network theory Unit disk graph Search algorithms Connectivity Topology control Independent set Dominating set