An AND/OR Graph Search Algorithm under the Admissibility Condition Relaxed
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 이채영 | ko |
| dc.date.accessioned | 2011-04-29T08:47:03Z | - |
| dc.date.available | 2011-04-29T08:47:03Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1989-06 | - |
| dc.identifier.citation | JOURNAL OF THE KOREAN OR/MS SOCIETY, v.14, no.1, pp.27 - 35 | - |
| dc.identifier.issn | 1225-1100 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/23435 | - |
| dc.description.abstract | An algorithm that searches the general AND-OR graph is proposed. The convergence and the efficiency of the algorithm is examined and compared with an existing algorithm for the AND-OR graph. It is proved that the proposed algorithm is superior to the existing method both in the quality of the solution and the number of node expansions. | - |
| dc.language | English | - |
| dc.language.iso | en_US | en |
| dc.publisher | 한국경영과학회 | - |
| dc.title | An AND/OR Graph Search Algorithm under the Admissibility Condition Relaxed | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 14 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 27 | - |
| dc.citation.endingpage | 35 | - |
| dc.citation.publicationname | JOURNAL OF THE KOREAN OR/MS SOCIETY | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | 이채영 | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.