default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaximilian Fickert
Person information
- affiliation: Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Maximilian Fickert:
Adaptive search techniques in AI planning and heuristic search. Saarland University, Saarbrücken, Germany, 2022- [j2]Maximilian Fickert, Jörg Hoffmann:
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning. J. Artif. Intell. Res. 73: 67-115 (2022) - [c14]Maximilian Fickert, Tianyi Gu, Wheeler Ruml:
New Results in Bounded-Suboptimal Search. AAAI 2022: 10166-10173 - 2021
- [c13]Maximilian Fickert
, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml:
Choosing the Initial State for Online Replanning. AAAI 2021: 12311-12319 - [c12]Maximilian Fickert, Tianyi Gu, Wheeler Ruml:
Bounded-cost Search Using Estimates of Uncertainty. IJCAI 2021: 1675-1681 - 2020
- [c11]Maximilian Fickert, Tianyi Gu, Leonhard Staut, Wheeler Ruml, Jörg Hoffmann, Marek Petrik:
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search. AAAI 2020: 9827-9834 - [c10]Joschka Gross, Álvaro Torralba, Maximilian Fickert:
Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning. AAAI 2020: 9875-9882 - [c9]Maximilian Fickert:
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search. ICAPS 2020: 119-123
2010 – 2019
- 2019
- [c8]Rebecca Eifler, Maximilian Fickert, Jörg Hoffmann, Wheeler Ruml:
Refining Abstraction Heuristics during Real-Time Planning. AAAI 2019: 7578-7585 - 2018
- [c7]Maximilian Fickert, Daniel Gnad, Jörg Hoffmann:
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. IJCAI 2018: 4750-4756 - [c6]Rebecca Eifler, Maximilian Fickert:
Online Refinement of Cartesian Abstraction Heuristics. SOCS 2018: 46-54 - [c5]Maximilian Fickert:
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning. SOCS 2018: 158-162 - 2017
- [c4]Maximilian Fickert, Jörg Hoffmann:
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. ICAPS 2017: 107-115 - [c3]Maximilian Fickert, Jörg Hoffmann:
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. SOCS 2017: 38-46 - 2016
- [j1]Maximilian Fickert, Jörg Hoffmann, Marcel Steinmetz:
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. J. Artif. Intell. Res. 56: 269-327 (2016) - [c2]Ruben Becker, Maximilian Fickert, Andreas Karrenbauer:
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX 2016: 151-159 - 2015
- [c1]Jörg Hoffmann, Maximilian Fickert:
Explicit Conjunctions without Compilation: Computing hFF(PiC) in Polynomial Time. ICAPS 2015: 115-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
