Space-efficient memory-based heuristics

摘要: A memory-based heuristic is a function that stored in lookup table. Very accurate heuristics have been created by building very large tables, sometimes called pattern databases. Most previous work assumes computed for the entire state space, and cost of computing it amortized over many problem instances. But some cases, may be useful to compute single instance. If start goal states instance are used restrict region space which needed, time substantially reduced. In this paper, we review recent uses idea space-efficient multiple sequence alignment problem. We then describe novel development simpler more general. Our approach leads improved performance solving problem, general enough apply other domains.