Heuristic solutions for the general maximum independent set problem with applications to expert system design

Autor:	I.F. Chang, H.-H. Teh, W.-Z. Shao
Rok vydání:	2003
Předmět:	Incremental heuristic search Mathematical optimization Computer science Heuristic Heuristic (computer science) Independent set Null-move heuristic Greedy algorithm Min-conflicts algorithm Consistent heuristic Killer heuristic Luus–Jaakola
Zdroj:	COMPSAC
Popis:	Proposes a set of heuristic algorithms for the solutions of the general maximum independent set problem. These include the commonsense heuristic algorithm, the first-ratio heuristic algorithm, the higher-order ratio heuristic algorithm, the peak heuristic algorithm, and the grouping heuristic algorithm. It is also shown how these algorithms may be used to improve the efficiency of expert system design. >
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d3bcaee8d4174393713fbbde6d6d5d07 https://doi.org/10.1109/cmpsac.1988.17215 Zobrazit plný text záznamu