scientific article; zbMATH DE number 2038892
From MaRDI portal
Publication:4449294
zbMath1036.68097MaRDI QIDQ4449294
Publication date: 8 February 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (19)
Learning from planner performance ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ An approach to efficient planning with numerical fluents and multi-criteria plan quality ⋮ Some computational aspects of DISTANCE SAT ⋮ Kernel functions for case-based planning ⋮ Agent planning programs ⋮ Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms ⋮ Planning in domains with derived predicates through rule-action graphs and local search ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Breadth-first heuristic search ⋮ Branching and pruning: An optimal temporal POCL planner based on constraint programming ⋮ Processes and continuous change in a SAT-based planner ⋮ Handling fuzzy temporal constraints in a planning environment ⋮ Star-topology decoupled state space search ⋮ Approximation of action theories and its application to conformant planning ⋮ Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ A case study in programming a quantum annealer for hard operational planning problems
Uses Software
This page was built for publication:
