๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Search for derivation as model of a heuristic process

โœ Scribed by S. Yu. Maslov

Publisher
Springer US
Year
1974
Tongue
English
Weight
661 KB
Volume
8
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Planning graph as the basis for deriving
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
โœ XuanLong Nguyen; Subbarao Kambhampati; Romeo S. Nigenda ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 561 KB

Most recent strides in scaling up planning have centered around two competing themesdisjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the t

Analysis of a Local Search Heuristic for
Analysis of a Local Search Heuristic for Facility Location Problems
โœ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati