Start Destination The Landmark Spider: Weaving the Landmark Web

Source URL: www.strc.ch

• Routing algorithms
• Mathematics
• Edsger W. Dijkstra
• Network theory
• Game artificial intelligence
• Graph theory
• Geography
• Search algorithms
• Wayfinding
• A* search algorithm
• Shortest path problem
• Landmark

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Combinatorial optimization
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Graph traversal
• Shortest path problem
• A* search algorithm
• Directed graph
• Matching
• Connectivity

Parallelism, Concurrency, and Asynchrony in Perl 6 Jonathan Worthington Hi!

Source URL: www.jnthn.net

• Software engineering
• Software
• Computing
• Cross-platform software
• High-level programming languages
• Scripting languages
• Parallel computing
• Edsger W. Dijkstra
• Concurrent computing
• Perl
• Thread
• Asynchrony

Route Choice: Models and Challenges Shlomo Bekhor Technion – Israel Institute of Technology Swiss Transport Research Conference

Source URL: www.strc.ch

• Metaphysics
• Network theory
• Philosophy
• Operations research
• Edsger W. Dijkstra
• Shortest path problem
• Simulation
• Transportation planning
• Choice modelling
• Choice
• Route choice
• Mathematics

Path Planning for Motion Dependent State Estimation on Micro Aerial Vehicles Markus W. Achtelik, Stephan Weiss, Margarita Chli and Roland Siegwart Abstract— With navigation algorithms reaching a certain maturity in the

Source URL: www.margaritachli.com

• Control theory
• Linear filters
• Edsger W. Dijkstra
• Kalman filter
• Robot control
• Shortest path problem
• Covariance

Weakest Precondition Synthesis for Compiler Optimizations Nuno P. Lopes and Jos´e Monteiro INESC-ID, IST Universidade de Lisboa Abstract. Compiler optimizations play an increasingly important role

Source URL: web.ist.utl.pt

• Software
• Computing
• Compiler construction
• Programming language implementation
• Compiler optimizations
• Formal methods
• Edsger W. Dijkstra
• Predicate transformer semantics
• Optimizing compiler
• Static single assignment form
• Compiler
• Psyco

Designing Better Fitness Functions for Automated Program Repair Ethan Fast Claire Le Goues

Source URL: dijkstra.cs.virginia.edu

Sampling-based Path Planning on Configuration-Space Costmaps L´eonard Jaillet, Juan Cort´es and Thierry Sim´eon Abstract—This paper addresses path planning considering a cost function defined over the configuration

Source URL: homepages.laas.fr

• Search algorithms
• Mathematics
• Routing algorithms
• Information science
• Information retrieval
• Edsger W. Dijkstra
• Combinatorial optimization
• Robot navigation
• A* search algorithm
• Shortest path problem
• Motion planning
• Rapidly-exploring random tree

Oracle Semantics for Concurrent Separation Logic (Extended Version) Aquinas Hobor1⋆ Andrew W. Appel1⋆ 1

Source URL: www.cs.princeton.edu

• Theoretical computer science
• Logic in computer science
• Logic
• Mathematical logic
• Edsger W. Dijkstra
• Formal methods
• Separation logic
• Substructural logic
• Concurrent computing
• Modal logic
• Semantics
• Parallel computing

Patches as Better Bug Reports Westley Weimer University of Virginia Abstract

Source URL: dijkstra.cs.virginia.edu