Full metadata record
DC FieldValueLanguage
dc.contributor.authorHWANG, WPen_US
dc.contributor.authorWANG, CLen_US
dc.date.accessioned2014-12-08T15:04:04Z-
dc.date.available2014-12-08T15:04:04Z-
dc.date.issued1994-04-01en_US
dc.identifier.issn0038-0644en_US
dc.identifier.urihttp://hdl.handle.net/11536/2568-
dc.description.abstractWe use procedural parameters as a means to cut off unwanted branches in a search tree. The technique may be used to effect non-blind backtracking. A recursive algorithm for generating all strings of n pairs of balanced parentheses is chosen as an illustrative example, since it cannot be formulated by conventional recursive backtracking.en_US
dc.language.isoen_USen_US
dc.subjectIMPERATIVE PROGRAMMINGen_US
dc.subjectPROCEDURAL PARAMETERSen_US
dc.subjectCONTINUATIONSen_US
dc.subjectPASCALen_US
dc.titleUSING PROCEDURAL PARAMETERS AND CONTINUATIONS IN COMBINATORIAL SEARCHESen_US
dc.typeArticleen_US
dc.identifier.journalSOFTWARE-PRACTICE & EXPERIENCEen_US
dc.citation.volume24en_US
dc.citation.issue4en_US
dc.citation.spage377en_US
dc.citation.epage386en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994NH00300003-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. A1994NH00300003.pdf