DocumentCode :
1872499
Title :
An evolutionary heuristic for knowledge base partitioning problem
Author :
Dutta, Paramartha
Author_Institution :
Electron. & Commun. Sci. Unit, Indian Stat. Inst., Calcutta, India
fYear :
1997
fDate :
13-16 Apr 1997
Firstpage :
657
Lastpage :
662
Abstract :
In this paper, I have tried to give an evolutionary heuristic to the knowledge base partitioning problem, which is a well-known NP-complete problem. There are different heuristics already existing to this end. After proposing my scheme, I make a comparative study in relation to the relative performance of my scheme vis-a`-vis an existing genetic algorithm on the same benchmark. I show how my algorithm has outperformed the existing one
Keywords :
computational complexity; deductive databases; file organisation; genetic algorithms; heuristic programming; knowledge based systems; software performance evaluation; NP-complete problem; evolutionary heuristic; genetic algorithm; knowledge base partitioning problem; performance; Artificial intelligence; Circuits; Computer science; Evolutionary computation; Expert systems; Genetic algorithms; NP-complete problem; Partitioning algorithms; Pattern recognition; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location :
Indianapolis, IN
Print_ISBN :
0-7803-3949-5
Type :
conf
DOI :
10.1109/ICEC.1997.592396
Filename :
592396
Link To Document :
بازگشت