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

Heuristic algorithms and learning techniques: applications to the graph coloring problem

โœ Scribed by Porumbel, Daniel Cosmin

Book ID
118793128
Publisher
Springer
Year
2011
Tongue
English
Weight
645 KB
Volume
10
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The pilot method: A strategy for heurist
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
โœ Duin, Cees; Vo๏ฟฝ, Stefan ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB ๐Ÿ‘ 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time

Algorithms for searching explicit AND/OR
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
โœ P.P. Chakrabarti ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 756 KB

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A