NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Learning dominance relations in combinatorial search problemsDominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.
Document ID
19880066472
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Yu, Chee-Fen
(Intel Artificial Intelligence Laboratory Santa Clara, CA, United States)
Wah, Benjamin W.
(Illinois, University Urbana, United States)
Date Acquired
August 13, 2013
Publication Date
August 1, 1988
Publication Information
Publication: IEEE Transactions on Software Engineering
Volume: 14
ISSN: 0098-5589
Subject Category
Computer Programming And Software
Accession Number
88A53699
Funding Number(s)
CONTRACT_GRANT: NCC2-481
CONTRACT_GRANT: NSF DMC-85-19649
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available