scientific article
From MaRDI portal
Publication:3198897
zbMath0713.68069MaRDI QIDQ3198897
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (18)
Deliberation scheduling for problem solving in time-constrained environments ⋮ Tractable approximate deduction for OWL ⋮ Anytime search in dynamic graphs ⋮ Network languages for concurrent multiagent systems ⋮ The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithms ⋮ The discovery of algorithmic probability ⋮ Wrappers for feature subset selection ⋮ Optimal composition of real-time systems ⋮ Abstraction and approximate decision-theoretic planning. ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Risk-optimal path planning in stochastic dynamic environments ⋮ Heuristic anytime approaches to stochastic decision processes ⋮ Principles and applications of continual computation ⋮ Global versus local search: the impact of population sizes on evolutionary algorithm performance ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ A complete anytime algorithm for number partitioning ⋮ Comparison of iterative improvement techniques for schedule optimization ⋮ The approximation of implicates and explanations
This page was built for publication:
