Choosing the Initial State for Online ReplanningMax Planck Institute for Software Systems
people.mpi-sws.org
von M Fickert · · Zitiert von: 3 — Maximilian Fickert,∗1 Ivan Gavran,∗2 Ivan Fedotov,. 2. Jörg Hoffmann,. 1. Rupak ... Maximilian Fickert was funded by DFG grant as part of TRR
A Novel Lookahead Strategy for Delete Relaxation ...ICAPS 2020
icaps20.icaps-conference.org
von M Fickert · Zitiert von: 10 — Maximilian Fickert. ICAPS Page 2. Classical Planning (FDR). A. B. C. • Variables: at,fuel. • Actions: drive(x, y): • pre = {at = x, fuel = 1}. • eff = ... von M Fickert · Zitiert von: 10 — Maximilian Fickert. ICAPS Page 2. Classical Planning (FDR). A. B. C. • Variables: at,fuel. • Actions: drive(x, y): • pre = {at = x, fuel = 1}. • eff = ...
Bounded-Cost Search Using Estimates of UncertaintyTianyi Gu
gtianyi.github.io
von M Fickert · Zitiert von: 3 — Maximilian Fickert, Tianyi Gu, Wheeler Ruml. The Problem Setting. C. I G. G. G. G. •Motivation: many real-world problems are too hard to solve. von M Fickert · Zitiert von: 3 — Maximilian Fickert, Tianyi Gu, Wheeler Ruml. The Problem Setting. C. I G. G. G. G. •Motivation: many real-world problems are too hard to solve.
Combining the Delete Relaxation with Critical-Path HeuristicsInternet Archive Scholar
scholar.archive.org
von M Fickert · Zitiert von: 16 — Submitted ??/??; published ??/?? Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. Maximilian Fickert. S9MAFICK@STUD ... von M Fickert · Zitiert von: 16 — Submitted ??/??; published ??/?? Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. Maximilian Fickert. S9MAFICK@STUD ...
Online Relaxation Refinement for Satisficing PlanningProQuest
search.proquest.com
von M Fickert · · Zitiert von: 2 — Maximilian Fickert -saarland.de. Jörg Hoffmann Maximilian Fickert was funded by DFG grant as part of TRR von M Fickert · · Zitiert von: 2 — Maximilian Fickert -saarland.de. Jörg Hoffmann Maximilian Fickert was funded by DFG grant as part of TRR
Alle Infos zum Namen "Maximilian Fickert"
A Novel Dual Ascent Algorithm for Solving the Min-Cost ...SIAM Publications Library
epubs.siam.org
von R Becker · · Zitiert von: 12 — A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. Authors: Ruben Becker, Maximilian Fickert, and Andreas KarrenbauerAuthors Info & ... von R Becker · · Zitiert von: 12 — A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. Authors: Ruben Becker, Maximilian Fickert, and Andreas KarrenbauerAuthors Info & ...
Bounded-Cost Search Using Estimates of UncertaintyNational Science Foundation (.gov)
par.nsf.gov
von M Fickert · · Zitiert von: 3 — Maximilian Fickert∗1 , Tianyi Gu∗2 , Wheeler Ruml2. 1Saarland University ... , 2020] Maximilian Fickert, Tianyi Gu, Leon- hard Staut, Wheeler Ruml, Jörg ... von M Fickert · · Zitiert von: 3 — Maximilian Fickert∗1 , Tianyi Gu∗2 , Wheeler Ruml2. 1Saarland University ... , 2020] Maximilian Fickert, Tianyi Gu, Leon- hard Staut, Wheeler Ruml, Jörg ...
New Results in Bounded-Suboptimal SearchNational Science Foundation (.gov)
par.nsf.gov
von M Fickert · · Zitiert von: 6 — Maximilian Fickert,*1 Tianyi Gu,*2 Wheeler Ruml2. 1 Saarland University, Saarland Informatics Campus, Saarbrücken, Germany. 2 Department of Computer Science ... von M Fickert · · Zitiert von: 6 — Maximilian Fickert,*1 Tianyi Gu,*2 Wheeler Ruml2. 1 Saarland University, Saarland Informatics Campus, Saarbrücken, Germany. 2 Department of Computer Science ...
On the Relation between Novelty and …nce PruningThe Association for the Advancement of Artificial Intelligence
ojs.aaai.org
von J Gross · · Zitiert von: 2 — Joschka Gross Saarland University, Saarland Informatics Campus · Alvaro Torralba CISPA Heimholz Center, Saarland Informatics Campus · Maximilian Fickert Saarland ... von J Gross · · Zitiert von: 2 — Joschka Gross Saarland University, Saarland Informatics Campus · Alvaro Torralba CISPA Heimholz Center, Saarland Informatics Campus · Maximilian Fickert Saarland ...
Online Relaxation Refinement for Satisficing PlanningJournal of Artificial Intelligence Research (JAIR)
www.jair.org
von M Fickert · · Zitiert von: 2 — Maximilian Fickert. a:1:{s:5:"en_US";s:19:"Saarland University";}. Jörg Hoffmann. Saarland University. Abstract. In classical AI planning ... von M Fickert · · Zitiert von: 2 — Maximilian Fickert. a:1:{s:5:"en_US";s:19:"Saarland University";}. Jörg Hoffmann. Saarland University. Abstract. In classical AI planning ...
Replacing Assumptions with Data in Real-Time SearchThe Association for the Advancement of Artificial Intelligence
aaai.org
von M Fickert · · Zitiert von: 7 — Maximilian Fickert Saarland University; Tianyi Gu University of New Hampshire; Leonhard Staut Saarland University; Wheeler Ruml University of New Hampshire ... von M Fickert · · Zitiert von: 7 — Maximilian Fickert Saarland University; Tianyi Gu University of New Hampshire; Leonhard Staut Saarland University; Wheeler Ruml University of New Hampshire ...
Combining the Delete Relaxation with Critical-Path HeuristicsJournal of Artificial Intelligence Research
jair.org
von M Fickert · · Zitiert von: 16 — Maximilian Fickert. Joerg Hoffmann. Marcel Steinmetz. Abstract. Recent work has shown how to improve delete relaxation heuristics by com…ng ...
Replacing Assumptions with Data in Real-Time SearchAAAI
ojs.aaai.org
von M Fickert · · Zitiert von: 7 — Maximilian Fickert Saarland University; Tianyi Gu University of New Hampshire; Leonhard Staut Saarland University; Wheeler Ruml University of New Hampshire ...
Verwandte Suchanfragen zu Maximilian Fickert
Joerg Hoffmann Ivan Fedotov Andreas Karrenbauer | Ivan Gavran Daniel Gnad Tina Jung | Patrick Speicher Maximilian Johannes Pascal Lauer |
Person "Fickert" (1) Vorname "Maximilian" (16070) Name "Fickert" (318) |
sortiert nach Relevanz / Datum