yusuke1997/dblp-id-title huggingface dataset:
On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract)
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results
Metareasoning in Real-Time Heuristic Search
Adding Diversity to Classical Heuristic Planning
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract)
Target-Value Search Revisited (Extended Abstract)
ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem
Experimental Evaluation of Classical Multi Agent Path Finding Algorithms
Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract)
Anytime AND/OR Depth-First Search for Combinatorial Optimization
Unbounded Sub-Optimal Conflict-Based Search in Complex Domains
Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics
Adversary Strategy Sampling for Effective Plan Generation
Domain Specific Situated Planning (Student Abstract)
Partial Domain Search Tree for Constraint-Satisfaction Problems
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning
From Fork Decoupling to Star-Topology Decoupling
Path Planning in Dynamic Environments with Adaptive Dimensionality
A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems
PLEASE: Palm Leaf Search for POMDPs with Large Observation Spaces
Multi-Agent Pickup and Delivery with Task Deadlines
A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations
Optimal Search with Neural Networks: Challenges and Approaches
Online Detection of Dead States in Real-Time Agent-Centered Search
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract)
Machine Teaching as Search
Multi-Agent Planning with Mixed-Integer Programming and Adaptive Interaction Constraint Generation (Extended Abstract)
Heuristic Contraction Hierarchies with Approximation Guarantee
Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract)
Benchmarks for Pathfinding Search: Iron Harvest
Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs
Learning Heuristic Functions Faster by Using Predicted Solution Costs
PASAR - Planning as Satisfiability with Abstraction Refinement
Conflict-Free Multi-Agent Meeting
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions
A Data Efficient Framework for Learning Local Heuristics
Surrogate Assisted Optimisation for Travelling Thief Problems
Benchmarks for Pathfinding in 3D Voxel Space
Extended Framework for Target Oriented Network Intelligence Collection
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract)
Solving the Watchman Route Problem on a Grid with Heuristic Search
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges
Online Multi-Agent Path Finding: New Results
Adaptive Parallelization for Constraint Satisfaction Search
Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020
To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract)
Proceedings of the Ninth Annual Symposium on Combinatorial Search, SOCS 2016, Tarrytown, NY, USA, July 6-8, 2016
Fast First-Move Queries through Run-Length Encoding
Repair Policies for Not Reopening Nodes in Different Search Settings
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives
Further Improved Heuristics For Conflict-Based Search
Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar
Light Contraction Hierarchies: Hierarchical Search Without Shortcuts
Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14-15 July 2018
Prioritised Planning with Guarantees
Exploring Conflict Generating Decisions: Initial Results (Extended Abstract)
Neural Network Heuristic Functions: Taking Confidence into Account
Latent Features for Algorithm Selection
Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions
Directed Plateau Search for MAX-k-SAT
Large-Scale Multi-Robot Coverage Path Planning via Local Search (Extended Abstract)
Structural Bias in Heuristic Search (Student Abstract)
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP
SoCS 2013 Organization
From Classical to Colored Multi-Agent Path Finding
Optimal Unlabeled Pebble Motion on Trees
Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search
Evolving Instance Specific Algorithm Configuration
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints
A-A*pex: Efficient Anytime Approximate Multi-Objective Search
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge
Proceedings of the Fourth Annual Symposium on Combinatorial Search, SOCS 2011, Castell de Cardona, Barcelona, Spain, July 15.16, 2011
A Neural Network for Decision Making in Real-Time Heuristic Search
SAT Feature Analysis for Machine Learning Classification Tasks
Fast k-Nearest Neighbor on a Navigation Mesh
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract)
Feasibility Study: Subgoal Graphs on State Lattices
When to Commit to an Action in Online Planning and Search
Heuristic Search and Receding-Horizon Planning in Complex Spacecraft Orbit Domains
Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning
Bi-Objective Search with Bi-directional A* (Extended Abstract)
Leveraging Experience in Lifelong Multi-Agent Pathfinding
Performance Analysis of Planning Portfolios
Domain-Independent Dynamic Programming (Student Abstract)
Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree
Local Motif Clustering via (Hyper)Graph Partitioning
Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem
Which MAPF Model Works Best for Automated Warehousing?
Calculating the Number of Order-6 Magic Squares with Modular Lifting
Bounded Suboptimal Search in Linear Space: New Results
Finding Maximum k-Cliques Faster Using Lazy Global Domination
Urban Traffic Control via Planning with Global State Constraints (Extended Abstract)
Focal Discrepancy Search for Learned Heuristics (Extended Abstract)
Position Paper: Using Early Goal Test in A
Finding Optimal Longest Paths by Dynamic Programming in Parallel
Compliant Conditions for Polynomial Time Approximation of Operator Counts
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis
Exploring the Synergy between Two Modular Learning Techniques for Automated Planning
Generalized Target Assignment and Path Finding Using Answer Set Programming
Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing
Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation
Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019
On the Benefits of Randomly Adjusting Anytime Weighted A
Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014, Prague, Czech Republic, 15-17 August 2014
Planning Paths with Fewer Turns on Grid Maps
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers
Computing Plans with Control Flow and Procedures Using a Classical Planner
Generating SAS+ Planning Tasks of Specified Causal Structure
A Theoretical Framework for Constraint Propagator Triggering
Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories
ePA*SE: Edge-Based Parallel A* for Slow Evaluations
Real-World Pickup and Delivery Problem with Transfers
A Theoretical Framework for Studying Random Walk Planning
Round-Based Public Transit Routing (Extended Abstract)
Measuring the Vulnerability of a Multi-Agent Pathfinding Solution
Search Algorithms for Multi-Agent Teamwise Cooperative Path Finding [Extended Abstract]
Improved Prediction of IDA*'s Performance via Epsilon-Truncation
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
Lazy Evaluation of Negative Preconditions in Planning Domains (Extended Abstract)
Efficient Multi Agent Path Finding with Turn Actions
Portal-Based True-Distance Heuristics for Path Finding
A* with Lookahead Re-Evaluated
Multi-agent Motion Planning through Stationary State Search (Extended Abstract)
A-MHA*: Anytime Multi-Heuristic A
Representing Pattern Databases with Succinct Data Structures
From Feasibility Tests to Path Planners for Multi-Agent Pathfinding
Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs
A Profit Guided Coordination Heuristic for Travelling Thief Problems
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions
Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics
No One SATPlan Encoding To Rule Them All
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics
On Improving Plan Quality via Local Enhancements
Avoiding Node Re-Expansions Can Break Symmetry Breaking
MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex Terrains
A Multi-Phase Search Approach to the LEGO Construction Problem
Alternative Forms of Bounded Suboptimal Search
Predicting Solution Cost with Conditional Probabilities
Solving the Target-Value Search Problem
Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths
Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract)
Weight Constrained Path Finding with Bidirectional A
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters
Effective Planning in Resource-Competition Problems by Task Decomposition
Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains
Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track
Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs
Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics
Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract)
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures
Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search
Novelty and Lifted Helpful Actions in Generalized Planning
Consistent Rounding of Edge Weights in Graphs
Improved Heuristic Search for Sparse Motion Planning Data Structures
Scalable Distributed Monte-Carlo Tree Search
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics
Efficient Single Frontier Bidirectional Search
Size-Independent Additive Pattern Databases for the Pancake Problem
Improved Safe Real-Time Heuristic Search
How Do You Know Your Search Algorithm and Code Are Correct?
Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory
Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract)
Avoiding Monochromatic Rectangles Using Shift Patterns
Max is More than Min: Solving Maximization Problems with Heuristic Search
Bounded Suboptimal Game Tree Search
Finding and Exploiting LTL Trajectory Constraints in Heuristic Search
Hybrid Planning Heuristics Based on Task Decomposition Graphs
Online Refinement of Cartesian Abstraction Heuristics
k-Robust Multi-Agent Path Finding
Solving Facility Location Problems via FastMap and Locality Sensitive Hashing
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs
Focused SANA: Speeding Up Network Alignment
Deployable Yet Effective Traffic Signal Optimisation via Automated Planning (Extended Abstract)
The JPS Pathfinding System
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation
The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem
Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
Additive Pattern Databases for Decoupled Search
Abstracting Abstraction in Search II: Complexity Analysis
Paper Summary: Time-Bounded Adaptive A
Distance Learning in Agent-Centered Heuristic Search
Counting Vertex-Disjoint Shortest Paths in Graphs
Cooperative Path Planning for Heterogeneous Agents
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract)
On Transposition Tables for Single-Agent Search and Planning: Summary of Results
SoCS 2010 Organization
Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search
Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS
Multi-Directional Search
Multi-Agent Open Framework: Developing a Holistic System to Solve MAPF (Student Abstract)
The JPS Pathfinding System in 3D
On Producing Shortest Cost-Optimal Plans
Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract)
Pipe-Routing and Pathfinding in 3D (Student Abstract)
Multi-Agent Path Execution with Uncertainty
Time-Bounded Best-First Search
An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract)
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract)
Generalized Longest Path Problems
Enhanced Multi-Objective A* Using Balanced Binary Search Trees
On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract)
k -Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited
Extreme Value Monte Carlo Tree Search (Extended Abstract)
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning
Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery
ReACT: Real-Time Algorithm Configuration through Tournaments
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations
F-Cardinal Conflicts in Conflict-Based Search
Sibling Conspiracy Number Search
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks
Multi-Robot Coordination and Layout Design for Automated Warehousing (Extended Abstract)
Maximum a Posteriori Estimation by Search in Probabilistic Programs
On Different Strategies for Eliminating Redundant Actions from Plans
Mutex Propagation in Multi-Agent Path Finding for Large Agents
Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA
Real-time Safe Interval Path Planning
Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems
Lazy Compilation in Classical Planning (Extended Abstract)
A Guide to Budgeted Tree Search
Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract)
On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE
Proceedings of the Tenth International Symposium on Combinatorial Search, SOCS 2017, 16-17 June 2017, Pittsburgh, Pennsylvania, USA
Optimal Solutions to Large Logistics Planning Domain Problems
Finding Acceptable Solutions Faster Using Inadmissible Information
Variable Annealing Length and Parallelism in Simulated Annealing
To UCT, or not to UCT? (Position Paper)
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]
Learning to Search More Efficiently from Experience: A Multi-Heuristic Approach
Extended Abstract: The Heuristic Search Research Framework
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984)
Efficient and Exact Public Transport Routing via a Transfer Connection Database
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds
Embedding Directed Graphs in Potential Fields Using FastMap-D
Cost-Based Heuristics and Node Re-Expansions across the Phase Transition
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract)
An Analysis Framework for Examination Timetabling
Anytime Tree-Restoring Weighted A* Graph Search
Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs
Real-Time Motion Planning with Dynamic Obstacles
Real-Time Optimization-Based Planning in Dynamic Environments Using GPUs
An Atom-Centric Perspective on Stubborn Sets
Meeting at the Border of Two Separate Domains
Evolving Solvers for FreeCell and the Sliding-Tile Puzzle
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning
Strengthening Canonical Pattern Databases with Structural Symmetries
Multimapping Abstractions and Hierarchical Heuristic Search
An Improved Algorithm for Optimal Coalition Structure Generation
Repeated-Task Canadian Traveler Problem
Bounded Suboptimal Heuristic Search in Linear Space
Speedy Versus Greedy Search
Fast Detection of Unsolvable Planning Instances Using Local Consistency
Planning with Always Preferences by Compilation into STRIPS with Action Costs
Bi-Criteria Diverse Plan Selection via Beam Search Approximation
Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories
Multi-Resolution A
Portability and Explainability of Synthesized Formula-based Heuristics
Abstract: Block A* and Any-Angle Path-Planning
Introducing Delays in Multi Agent Path Finding
Customizable Route Planning in Road Networks (Extended Abstract)
Forward Search in Contraction Hierarchies
Type System Based Rational Lazy IDA
Execution Ordering in AND/OR Graphs with Failure Probabilities
Maintaining and Handling All Unit Propagation Reasons in Exact Max-SAT Solvers
Real-Time Adaptive A* with Depression Avoidance
Using Machine Learning Classifiers in SAT Branching [Extended Abstract]
A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems
Brigitte, a Bridge-Based Grid Path-Finder
Solving the Snake in the Box Problem with Heuristic Search: First Results
Avoiding Re-expansions in Suboptimal Best-First Search
Bidirectional Preference-Based Search for State Space Graph Problems
Core Expansion in Optimization Crosswords
Multi-Train Path Finding Revisited
Error Analysis and Correction for Weighted A*'s Suboptimality
A Planning-based Approach for In-Station Train Dispatching
Efficiently Finding Optimal Winding-Constrained Loops in the Plane: Extended Abstract
Red-Black Planning: A New Tractability Analysis and Heuristic Function
E-Graphs: Bootstrapping Planning with Experience Graphs
Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities
Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, 11-13 June 2015, Ein Gedi, the Dead Sea, Israel
Learning Pseudo-Backdoors for Mixed Integer Programs
Parallel Beam Search for Combinatorial Optimization (Extended Abstract)
Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information
Efficient Implementation of Pattern Database Heuristics for Classical Planning
Subdimensional Expansion and Optimal Task Reassignment
A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract)
Landmark Heuristics for the Pancake Problem
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding
Best-First Search for Bounded-Depth Trees
Reducing Redundant Work in Jump Point Search
Fast, Optimal Pathfinding with Compressed Path Databases
Polynomial-Time Construction of Contraction Hierarchies for Multi-Criteria Objectives
Expected Path Degradation when Searching over a Sparse Grid Hierarchy
SoCS 2014 Organization
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants
Toward a Search Strategy for Anytime Search in Linear Space Using Depth-First Branch and Bound
Automatic Move Pruning Revisited
On the Attainability of NK Landscapes Global Optima
Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
Complete Search of Sliding Tile Puzzles on a Personal Computer [Extended Abstract]
Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions
Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements
Bootstrap Learning of Heuristic Functions
Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)
Landmark Heuristics for Lifted Planning - Extended Abstract
Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding
STLS: Cycle-Cutset-Driven Local Search For MPE
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
Uncertainty and Dynamicity in Real-World Vehicle Routing (Student Abstract)
Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP
Shortest Path for K Goals
Delete Relaxations for Planning with State-Dependent Action Costs
A Deterministic Search Approach for Solving Stochastic Drone Search and Rescue Planning Without Communications
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract)
On the Differences and Similarities of fMM and GBFHS
Heuristic Search for the Orienteering Problem with Time-Varying Reward
The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search
On Realizing Planning Programs in Domains with Dead-End States
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract)
Multi-Agent Path Finding for Self Interested Agents
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees
Challenging Human Supremacy in Skat
State-Set Search
Feature Selection as State-Space Search: An Empirical Study in Clustering Problems
Potential Search: A New Greedy Anytime Heuristic Search
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery
The Hierarchy in Grid Graphs (Extended Abstract)
Learning to Generate Industrial SAT Instances
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract)
Block-Parallel IDA* for GPUs
Scaling Up Search with Partial Initial States in Optimization Crosswords
The Logic of Benchmarking: A Case Against State-of-the-Art Performance
2D Path Planning Based on Dijkstra's Algorithm and Pseudo Priority Queues
Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding
A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding
GBFHS: A Generalized Breadth-First Heuristic Search Algorithm
Improving Local Search for Resource-Constrained Planning
Parallelizing Multi-objective A* Search (Extended Abstract)
Path Planning with Adaptive Dimensionality
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies
Advice-Giving Systems for Selecting Interaction Objects
A UML-Based Design Environment for Interactive Applications
Secure Interface for Risk Management Services
Challenges in Content Management for B2B Electronic Commerce
A Visual Interface and Navigator for the P/FDM Object Database
The Design of Query Interfaces to the GPCRDB Biological Database
Considering Possible Outcomes and the User's Environment in Designing User Interfaces for Data Intensive Systems