On the public citation graph
Additive Pattern Database Heuristics
0 signed · 191 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/3-540-46784-x_30openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/3-540-49116-3_53openalex-snapshot
Upper Bounds for Vertex Cover Further Improved
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_7openalex-snapshot
Parameterized Computational Feasibility
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0004-3702(85)90012-8openalex-snapshot
Macro-operators: A weak method for learning
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0020-0255(92)90070-oopenalex-snapshot
Criticizing solutions to relaxed models yields powerful admissible heuristics
inferredcites →https://doi.org/10.1016/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1016/s0004-3702(01)00094-7openalex-snapshot
Time complexity of iterative-deepening-A∗
inferredcites →https://doi.org/10.1016/s0020-0190(97)00213-5openalex-snapshot
An improved fixed-parameter algorithm for vertex cover
inferredcites →https://doi.org/10.1093/comjnl/35.1.91openalex-snapshot
An Iterative Algorithm for the Reve's Puzzle
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.3929/ethz-a-001948321openalex-snapshot
ZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11527862_18openalex-snapshot
Solving the 24 Puzzle with Instance Dependent Pattern Databases
inferred← citeshttps://doi.org/10.1007/11527862_22openalex-snapshot
Experiments with Multiple Abstraction Heuristics in Symbolic Verification
inferred← citeshttps://doi.org/10.1007/11527862_9openalex-snapshot
Hierarchical Heuristic Search Revisited
inferred← citeshttps://doi.org/10.1007/11758471_31openalex-snapshot
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
inferred← citeshttps://doi.org/10.1007/978-1-4939-6613-4_20openalex-snapshot
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
inferred← citeshttps://doi.org/10.1007/978-1-60327-429-6_21openalex-snapshot
Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_1openalex-snapshot
Heuristically Ordered Search in State Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_11openalex-snapshot
Artificial Intelligence for Games
inferred← citeshttps://doi.org/10.1007/978-3-030-70594-7_12openalex-snapshot
Near Optimal Solving of the (N$$^2$$–1)-puzzle Using Heuristics Based on Artificial Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-75418-1_9openalex-snapshot
An Investigation of Problem Instance Difficulty for Case-Based Reasoning and Heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-031-97000-9_17openalex-snapshot
Construction of Large Zero-Aware Pattern Databases for Sliding Puzzles on Distributed Memory Machines
inferred← citeshttps://doi.org/10.1007/978-3-032-23607-4_8openalex-snapshot
Algorithmic Prompt-Augmentation for Efficient LLM-Based Heuristic Design for A* Search
inferred← citeshttps://doi.org/10.1007/978-3-319-03680-9_19openalex-snapshot
A New Efficient In Situ Sampling Model for Heuristic Selection in Optimal Search
inferred← citeshttps://doi.org/10.1007/978-3-319-05428-5_2openalex-snapshot
Building Large Compressed PDBs for the Sliding Tile Puzzle
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_14openalex-snapshot
Combining Perimeter Search and Pattern Database Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_41openalex-snapshot
Using Infeasibility to Improve Abstraction-Based Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_5openalex-snapshot
Partial Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_4openalex-snapshot
Scaling Search with Pattern Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_8openalex-snapshot
Solving Non-deterministic Planning Problems with Pattern Database Heuristics
inferred← citeshttps://doi.org/10.1007/978-981-15-0035-0_40openalex-snapshot
An N-Puzzle Solver Using Tissue P System with Evolutional Symport/Antiport Rules and Cell Division
inferred← citeshttps://doi.org/10.1007/s10458-016-9333-9openalex-snapshot
Collaborative privacy preserving multi-agent planning
inferred← citeshttps://doi.org/10.1007/s10472-005-9001-2openalex-snapshot
Finding optimal solutions to the graph partitioning problem with heuristic search
inferred← citeshttps://doi.org/10.1007/s10472-014-9432-8openalex-snapshot
Predicting optimal solution cost with conditional probabilities
inferred← citeshttps://doi.org/10.1007/s10472-014-9439-1openalex-snapshot
Heuristics as Markov chains
inferred← citeshttps://doi.org/10.1016/j.artint.2006.09.002openalex-snapshot
Maximizing over multiple pattern databases speeds up heuristic search
inferred← citeshttps://doi.org/10.1016/j.artint.2007.10.019openalex-snapshot
Duality in permutation state spaces and the dual search algorithm
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.021openalex-snapshot
Optimal admissible composition of abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2011.02.001openalex-snapshot
Inconsistent heuristics in theory and practice
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.003openalex-snapshot
Landmark-enhanced abstraction heuristics
inferred← citeshttps://doi.org/10.1016/j.artint.2014.05.002openalex-snapshot
Potential-based bounded-cost search and Anytime Non-Parametric A⁎
inferred← citeshttps://doi.org/10.1016/j.artint.2014.11.006openalex-snapshot
Conflict-based search for optimal multi-agent pathfinding
inferred← citeshttps://doi.org/10.1016/j.artint.2015.05.011openalex-snapshot
Optimal Sokoban solving using pattern databases with specific domain knowledge
inferred← citeshttps://doi.org/10.1016/j.artint.2017.12.004openalex-snapshot
Star-topology decoupled state space search
inferred← citeshttps://doi.org/10.1016/j.artint.2018.02.002openalex-snapshot
Symbolic perimeter abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.1016/j.cor.2018.06.021openalex-snapshot
An exact algorithm for the Blocks Relocation Problem with new lower bounds
inferred← citeshttps://doi.org/10.1016/j.egyai.2021.100119openalex-snapshot
Effective rural electrification via optimal network: Optimal path-finding in highly anisotropic search space using multiplier-accelerated A* algorithm
inferred← citeshttps://doi.org/10.1016/j.jda.2009.08.001openalex-snapshot
Fixed-parameter tractability results for feedback set problems in tournaments
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.05.009openalex-snapshot
The Heuristic Search Research Framework
inferred← citeshttps://doi.org/10.1017/9781108164085.002openalex-snapshot
Artificial Intelligence and Agents
inferred← citeshttps://doi.org/10.1017/9781108164085.003openalex-snapshot
Agent Architectures and Hierarchical Control
inferred← citeshttps://doi.org/10.1017/9781108164085.008openalex-snapshot
Supervised Machine Learning
inferred← citeshttps://doi.org/10.1017/9781108164085.015openalex-snapshot
Ontologies and Knowledge-Based Systems
inferred← citeshttps://doi.org/10.1017/9781108164085.016openalex-snapshot
Relational Planning, Learning, and Probabilistic Reasoning
inferred← citeshttps://doi.org/10.1017/9781108164085.018openalex-snapshot
Mathematical Preliminaries and Notation
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.003openalex-snapshot
Agent Architectures and Hierarchical Control
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.006openalex-snapshot
Propositions and Inference
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.013openalex-snapshot
Individuals and Relations
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.014openalex-snapshot
Ontologies and Knowledge-Based Systems
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.015openalex-snapshot
Relational Planning, Learning, and Probabilistic Reasoning
inferred← citeshttps://doi.org/10.1017/cbo9780511794797.017openalex-snapshot
Mathematical Preliminaries and Notation
inferred← citeshttps://doi.org/10.1038/s42256-019-0070-zopenalex-snapshot
Solving the Rubik’s cube with deep reinforcement learning and search
inferred← citeshttps://doi.org/10.1080/17445761003604521openalex-snapshot
Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1109/ai4g50087.2020.9311085openalex-snapshot
Optimizing Networked Rural Electrification Design using Adaptive Multiplier-Accelerated A* Algorithm
inferred← citeshttps://doi.org/10.1109/airc69745.2026.11631347openalex-snapshot
A Robot That Plays The Fifteen Puzzle
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840588openalex-snapshot
Exact structure learning of Bayesian networks by optimal path extension
inferred← citeshttps://doi.org/10.1109/bracis.2016.022openalex-snapshot
Solving Atomix with Pattern Databases
inferred← citeshttps://doi.org/10.1109/cec.2017.7969355openalex-snapshot
Harmonic analysis and resynthesis of Sliding-Tile Puzzle heuristics
inferred← citeshttps://doi.org/10.1109/depcos-relcomex.2007.18openalex-snapshot
Development of distributed planner for decision support systems
inferred← citeshttps://doi.org/10.1109/etcc65847.2025.11108541openalex-snapshot
Enhancing Greedy Best-First Search with Dynamic Heuristic for Puzzle Solving
inferred← citeshttps://doi.org/10.1109/icacr62205.2024.11053726openalex-snapshot
A Robot That Plays Rubik's Race, a Slide Puzzle Game
inferred← citeshttps://doi.org/10.1109/icai67591.2025.11325086openalex-snapshot
A Comparative Analysis of Informed and Uninformed Search Algorithms for the 8-Puzzle Problem with a Novel Hybrid Approach
inferred← citeshttps://doi.org/10.1109/icpp.2006.9openalex-snapshot
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197338openalex-snapshot
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics
inferred← citeshttps://doi.org/10.1109/iemcon.2018.8614941openalex-snapshot
Multi-Heuristic State Space Search
inferred← citeshttps://doi.org/10.1109/infrkm.2012.6204992openalex-snapshot
Querying connected tuple trees for relational keyword search
inferred← citeshttps://doi.org/10.1109/tciaig.2009.2019632openalex-snapshot
Extending the Applicability of Pattern and Endgame Databases
inferred← citeshttps://doi.org/10.1109/tqe.2024.3429451openalex-snapshot
BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures
inferred← citeshttps://doi.org/10.1142/9789812771667_0001openalex-snapshot
Fixed-Parameter Algorithms for Graph-Modeled Data Clustering
inferred← citeshttps://doi.org/10.1177/02783649211069572openalex-snapshot
Adaptively Informed Trees (AIT*) and Effort Informed Trees (EIT*): Asymmetric bidirectional sampling-based path planning
inferred← citeshttps://doi.org/10.1527/tjsai.26.419openalex-snapshot
Fast Search for Optimal Solutions of the Fifteen Puzzle Using Gap Sets
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7563openalex-snapshot
Searching Without a Heuristic: Efficient Use of Abstraction
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7741openalex-snapshot
To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8140openalex-snapshot
Conflict-Based Search For Optimal Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9061openalex-snapshot
Tightening Bounds for Bayesian Network Structure Learning
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.9873openalex-snapshot
What's Hot in Heuristic Search
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10665openalex-snapshot
Value Compression of Pattern Databases
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012379openalex-snapshot
Enriching Non-Parametric Bidirectional Search Algorithms
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5611openalex-snapshot
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17419openalex-snapshot
Saturated Post-hoc Optimization for Classical Planning
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17469openalex-snapshot
Policy-Guided Heuristic Search with Guarantees
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21212openalex-snapshot
Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics
inferred← citeshttps://doi.org/10.1609/aaai.v37i10.26469openalex-snapshot
Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13351openalex-snapshot
Structural-Pattern Databases
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13447openalex-snapshot
When Optimal Is Just Not Good Enough: Learning Fast Informative Action Cost Partitionings
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13455openalex-snapshot
Potential Search: A Bounded-Cost Search Algorithm
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13563openalex-snapshot
Using Alternative Suboptimality Bounds in Heuristic Search
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13801openalex-snapshot
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13808openalex-snapshot
Tailoring Pattern Databases for Unsolvable Planning Instances
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13823openalex-snapshot
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13883openalex-snapshot
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6647openalex-snapshot
Solving the Longest Simple Path Problem with Heuristic Search
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15941openalex-snapshot
The Consistent Case in Bidirectional Search and a Bucket-to-Bucket Algorithm as a Middle Ground between Front-to-End and Front-to-Front
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15963openalex-snapshot
Pattern Databases for Goal-Probability Maximization in Probabilistic Planning
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31454openalex-snapshot
Specifying Goals to Deep Neural Networks with Answer Set Programming
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18488openalex-snapshot
Enriching Non-Parametric Bidirectional Search Algorithms — Extended Abstract
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18500openalex-snapshot
Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18508openalex-snapshot
Improving Bidirectional Heuristic Search by Bounds Propagation
inferred← citeshttps://doi.org/10.1609/socs.v10i1.18511openalex-snapshot
Interleaving Search and Heuristic Improvement
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18561openalex-snapshot
Pattern Databases for Stochastic Shortest Path Problems
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21752openalex-snapshot
Generalized Longest Path Problems
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21758openalex-snapshot
Optimal Search with Neural Networks: Challenges and Approaches
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21766openalex-snapshot
Additive Pattern Databases for Decoupled Search
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31550openalex-snapshot
On the Properties of All-Pair Heuristics
inferred← citeshttps://doi.org/10.1609/socs.v17i1.31582openalex-snapshot
On Parallel External-Memory Bidirectional Search (Extended Abstract)
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18150openalex-snapshot
Evolving Hyper Heuristic-Based Solvers for Rush Hour and FreeCell
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18196openalex-snapshot
Predicting Solution Cost with Conditional Probabilities
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18203openalex-snapshot
Faster Optimal and Suboptimal Hierarchical Search
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18207openalex-snapshot
Probably Approximately Correct Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18236openalex-snapshot
Search-Aware Conditions for Probably Approximately Correct Heuristic Search
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18241openalex-snapshot
Are We There Yet? — Estimating Search Progress
inferred← citeshttps://doi.org/10.1609/socs.v3i1.18259openalex-snapshot
A* Variants for Optimal Multi-Agent Pathfinding
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18290openalex-snapshot
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18357openalex-snapshot
Solving the Snake in the Box Problem with Heuristic Search: First Results
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18395openalex-snapshot
Repair Policies for Not Reopening Nodes in Different Search Settings
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18426openalex-snapshot
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18447openalex-snapshot
Online Refinement of Cartesian Abstraction Heuristics
inferred← citeshttps://doi.org/10.1613/jair.1.13153openalex-snapshot
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
inferred← citeshttps://doi.org/10.1613/jair.2486openalex-snapshot
A General Theory of Additive State Space Abstractions
inferred← citeshttps://doi.org/10.1613/jair.3779openalex-snapshot
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces
inferred← citeshttps://doi.org/10.1613/jair.4039openalex-snapshot
Learning Optimal Bayesian Networks: A Shortest Path Perspective
inferred← citeshttps://doi.org/10.20381/ruor-19599openalex-snapshot
Automatically generated lower bounds for search
inferred← citeshttps://doi.org/10.2139/ssrn.6891367openalex-snapshot
Regime Structure in Tree Search: Theory and Experimental Cross-Domain Behavioural Analysis
inferred← citeshttps://doi.org/10.24963/ijcai.2017/601openalex-snapshot
On Creating Complementary Pattern Databases
inferred← citeshttps://doi.org/10.24963/ijcai.2019/63openalex-snapshot
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
inferred← citeshttps://doi.org/10.24963/ijcai.2019/646openalex-snapshot
Procedural Generation of Initial States of Sokoban
inferred← citeshttps://doi.org/10.24963/ijcai.2019/780openalex-snapshot
Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning
inferred← citeshttps://doi.org/10.24963/ijcai.2020/664openalex-snapshot
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound
inferred← citeshttps://doi.org/10.3233/978-1-58603-891-5-495openalex-snapshot
Compressing Pattern Databases with Learning
inferred← citeshttps://doi.org/10.3233/aic-170743openalex-snapshot
The compressed differential heuristic
inferred← citeshttps://doi.org/10.3233/aic-2011-0504openalex-snapshot
Implicit abstraction heuristics for cost-optimal planning
inferred← citeshttps://doi.org/10.32604/cmc.2024.057431openalex-snapshot
Patterns in Heuristic Optimization Algorithms: A Comprehensive Analysis
inferred← citeshttps://doi.org/10.3390/computers12010011openalex-snapshot
The Fifteen Puzzle—A New Approach through Hybridizing Three Heuristics Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1210.4913openalex-snapshot
An Improved Admissible Heuristic for Learning Optimal Bayesian Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2111.01877openalex-snapshot
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
inferred← citeshttps://doi.org/10.5120/8347-1894openalex-snapshot
Genetic based Algorithm for N - Puzzle Problem
inferred← citeshttps://doi.org/10.5121/ijcseit.2012.2602openalex-snapshot
Efficient Schema Based Keyword Search in Relational Databases
inferred← citeshttps://doi.org/10.5451/unibas-ep32799openalex-snapshot
Getting the most out of pattern databases for classical planning
inferred← citeshttps://doi.org/10.5451/unibas-ep37536openalex-snapshot
Linear programming for heuristics in optimal planning
inferred← citeshttps://doi.org/10.5451/unibas-ep45218openalex-snapshot
State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning
inferred← citeshttps://doi.org/10.5555/2591248.2591250openalex-snapshot
Learning optimal bayesian networks
inferred← citeshttps://doi.org/10.5860/choice.48-2130openalex-snapshot
Artificial intelligence: foundations of computational agents
inferred← citeshttps://doi.org/10.70675/95250d79z6211z4752zb64az3fa07526ff09openalex-snapshot
Méthodes exactes pour l'apprentissage de la structure d'un réseau bayésien et les réseaux de fonctions de coûts
inferred← citeshttps://doi.org/10.7936/k7rj4gtnopenalex-snapshot
Exploiting Bounds in Operations Research and Artificial Intelligence
inferred← citeshttps://doi.org/10.7939/r3668topenalex-snapshot
Cluster-and-Conquer: a Paradigm for Solving State-Space Problems
inferred← citeshttps://doi.org/10.7939/r3dw6topenalex-snapshot
Multimapping Abstraction and State-set Search Theory
inferred← citeshttps://doi.org/10.7939/r3q52fg8copenalex-snapshot
A General Additive Search Abstraction
inferred← citeshttps://doi.org/10.7939/r3sj1b03gopenalex-snapshot
Design Decisions in Suboptimal Heuristic Search-Based Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.