| Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks
|
2020 |
Abeywickrama, Tenindra |
| Observation Decoding with Sensor Models: Recognition Tasks via Classical Planning
|
2020 |
Aineto, Diego |
| Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications
|
2020 |
Chatterjee, Krishnendu |
| Lifted Successor Generation Using Query Optimization Techniques
|
2020 |
Corrêa, Augusto B. |
| Solving K-MDPs
|
2020 |
Ferrer-Mestres, Jonathan |
| Strengthening Potential Heuristics with Mutexes and Disambiguations
|
2020 |
Fišer, Daniel |
| A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search
|
2020 |
Fickert, Maximilian |
| Online Computation of Euclidean Shortest Paths in Two Dimensions
|
2020 |
Hechenberger, Ryan |
| Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks
|
2020 |
Hunsberger, Luke |
| Algorithm Selection for Optimal Multi-Agent Pathfinding
|
2020 |
Kaduri, Omri |
| On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs
|
2020 |
Nebel, Bernhard |
| Solving the Watchman Route Problem on a Grid with Heuristic Search
|
2020 |
Seiref, Shawn |
| POMDP + Information-Decay: Incorporating Defender's Behaviour in Autonomous Penetration Testing
|
2020 |
Schwartz, Jonathon |
| Computing Close to Optimal Weighted Shortest Paths in Practice
|
2020 |
Tran, Nguyet |
| Contention-Aware Mapping and Scheduling Optimization for NoC-Based MPSoCs
|
2020 |
Yan, Rongjie |
| Multi-Agent Path Finding with Mutex Propagation
|
2020 |
Zhang, Han |
| Solving the Test Laboratory Scheduling Problem with Variable Task Grouping
|
2020 |
Danzinger, Philipp |
| Driver Activity Recognition by Means of Temporal HTN Planning
|
2020 |
Fernandez-Olivares, Juan |
| Optimal and Heuristic Approaches for Constrained Flight Planning under Weather Uncertainty
|
2020 |
Geißer, Florian |
| Exploring Context-Free Languages via Planning: The Case for Automating Machine Learning
|
2020 |
Katz, Michael |
Tag hinzufügen