Dijkstra - PDFSEARCH.IO - Document Search Engine

Dijkstra
Results: 449

#	Item
111	Geometric Ad-Hoc Routing: Of Theory and Practice∗ Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerland {kuhn, wattenhofer, yzhang, zollinger}@inf Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:22 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra NP-complete problems Network theory Geographic routing Shortest path problem Geometric spanner Routing Planar graph Unit disk graph
112	Distributed Computing Prof. R. Wattenhofer BA/MA/SA: Multi-Agent Pathfinding and Crowd Simulation Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-02-12 10:14:19 Edsger W. Dijkstra Game artificial intelligence Pathfinding Multi-agent system Simulation
113	Using Contracts to Guide the Search-Based Verification of Concurrent Programs Christopher M. Poskitt1 and Simon Poulding2 1 2 Add to Reading List Source URL: se.inf.ethz.ch Language: English - Date: 2013-08-09 13:49:10 Software engineering Computing Computer programming Concurrency control Concurrent computing Edsger W. Dijkstra Object-oriented programming languages Concurrent programming languages Concurrency Concurrent data structure Thread SCOOP
114	SyncProf: Detecting, Localizing, and Optimizing Synchronization Bottlenecks Tingting Yu Michael Pradel Add to Reading List Source URL: mp.binaervarianz.de Language: English - Date: 2016-05-19 17:56:20 Concurrency control Computing Software engineering Economy Software optimization Edsger W. Dijkstra Network performance Communication Synchronization Bottleneck Lock Mutual exclusion
115	11276_2007_45_14_5-web Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:46 Graph theory Routing algorithms Mathematics Computing Wireless networking Routing protocols Network theory Edsger W. Dijkstra Geographic routing Shortest path problem Routing Unit disk graph
116	XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland Add to Reading List Source URL: disco.ethz.ch Language: English Graph theory Mathematics NP-complete problems Spanning tree Edsger W. Dijkstra Routing algorithms Search algorithms Topology control Unit disk graph Connectivity Minimum spanning tree Bipartite graph
117	Hierarchical Path Planning for Multi-Size Agents in Heterogeneous Environments Daniel Harabor† Abstract— Path planning is a central topic in games and other research areas, such as robotics. Despite this, very little Add to Reading List Source URL: www.csse.uwa.edu.au Language: English - Date: 2009-02-05 01:17:36 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra Game artificial intelligence Search algorithms Pathfinding Line graph Graph A* search algorithm Directed graph Shortest path problem
118	Worst-Case Optimal and Average-Case Efficient ∗ Geometric Ad-Hoc Routing Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:29 Routing algorithms Mathematics Wireless networking Computing Routing protocols Graph theory Network theory Edsger W. Dijkstra Geographic routing Greedy algorithm Routing Shortest path problem
119	Efficient and Effective Matching of Image Sequences Under Substantial Appearance Changes Exploiting GPS Priors Olga Vysotska Tayyab Naseer Add to Reading List Source URL: europa2.informatik.uni-freiburg.de Language: English - Date: 2015-09-26 10:11:08 Graph theory Mathematics Network theory Edsger W. Dijkstra Shortest path problem Matching Topological sorting Matrix Graph
120	Distributed Computing Prof. R. Wattenhofer BA/MA/SA: Multi-Agent Pathfinding and Crowd Simulation Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-03-02 11:09:01 Edsger W. Dijkstra Game artificial intelligence Pathfinding Multi-agent system Simulation

UPDATE