conftrace_

Peter J. Stuckey

40 papers · 2013–2025 · 5 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+14 more ↓ 🌍 Conference Polyglot (5) 🐣 Hot Topic Early Bird 🧭 Keyword Pioneer πŸŒ‰ Interdisciplinary Bridge πŸƒ Academic Marathon (12)
🧭 Keyword Pioneer 🐣 Hot Topic Early Bird πŸƒ Academic Marathon (12) 🏠 Conference Loyalist (23) 🀝 Dynamic Duo (10) πŸ”¬ Deep Specialist (12) 🧬 Topic Evolution πŸ† Keyword Champion (2) ⚑ Prolific Year (6) ❓ The Questioner πŸ—ƒοΈ Keyword Collector (155) πŸ’Ž Century Club (40) πŸ”₯ Unstoppable (8) πŸš€ Conference Pioneer

Conferences

AAAI (23) IJCAI (14) ICCV (1) JMLR (1) NIPS (1)

Papers

Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding AAAI 2025 Dynamic Replanning for Improved Public Transport Routing IJCAI 2025 Most General Explanations of Tree Ensembles IJCAI 2025 NAVER: A Neuro-Symbolic Compositional Automaton for Visual Grounding with Explicit Logic Reasoning ICCV 2025 Acoustic-to-Hyper-Spectral: Hyper-Spectral Image Construction from Frequency Spectrums Through Simulated Annealing (Student Abstract) AAAI 2025 Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities AAAI 2025 Multi-Stage Predict+Optimize for (Mixed Integer) Linear Programs NIPS 2024 Delivering Inflated Explanations AAAI 2024 Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding AAAI 2024 Eliminating the Impossible, Whatever Remains Must Be True: On Extracting and Applying Background Knowledge in the Context of Formal Explanations AAAI 2023 Optimal Pathfinding on Weighted Grid Maps AAAI 2023 A Regular Matching Constraint for String Variables IJCAI 2023 MurTree: Optimal Decision Trees via Dynamic Programming and Search JMLR 2022 A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems AAAI 2022 Using MaxSAT for Efficient Explanations of Tree Ensembles AAAI 2022 Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding AAAI 2022 MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search AAAI 2022 Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning AAAI 2021 A Scalable Two Stage Approach to Computing Optimal Decision Sets AAAI 2021 f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search AAAI 2021 Symmetry Breaking for k-Robust Multi-Agent Path Finding AAAI 2021 Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021 Reasoning-Based Learning of Interpretable ML Models IJCAI 2021 Optimal Decision Trees for Nonlinear Metrics AAAI 2021 Modelling and Solving Online Optimisation Problems AAAI 2020 Iterative-Deepening Conflict-Based Search IJCAI 2020 Euclidean Pathfinding with Compressed Path Databases IJCAI 2020 Did That Lost Ballot Box Cost Me a Seat? Computing Manipulations of STV Elections AAAI 2020 Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems AAAI 2020 Modelling Diversity of Solutions AAAI 2020 Dynamic Programming for Predict+Optimise AAAI 2020 Branch-and-Cut-and-Price for Multi-Agent Pathfinding IJCAI 2019 Searching with Consistent Prioritization for Multi-Agent Path Finding AAAI 2019 Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding AAAI 2019 Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions IJCAI 2019 Path Planning with CPD Heuristics IJCAI 2019 Regarding Jump Point Search and Subgoal Graphs IJCAI 2019 Machine Learning and Constraint Programming for Relational-To-Ontology Schema Mapping IJCAI 2018 Sequencing Operator Counts IJCAI 2016 Breaking Symmetries in Graph Representation IJCAI 2013