完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | HWANG, WP | en_US |
dc.contributor.author | WANG, CL | en_US |
dc.date.accessioned | 2014-12-08T15:04:04Z | - |
dc.date.available | 2014-12-08T15:04:04Z | - |
dc.date.issued | 1994-04-01 | en_US |
dc.identifier.issn | 0038-0644 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/2568 | - |
dc.description.abstract | We 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.iso | en_US | en_US |
dc.subject | IMPERATIVE PROGRAMMING | en_US |
dc.subject | PROCEDURAL PARAMETERS | en_US |
dc.subject | CONTINUATIONS | en_US |
dc.subject | PASCAL | en_US |
dc.title | USING PROCEDURAL PARAMETERS AND CONTINUATIONS IN COMBINATORIAL SEARCHES | en_US |
dc.type | Article | en_US |
dc.identifier.journal | SOFTWARE-PRACTICE & EXPERIENCE | en_US |
dc.citation.volume | 24 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 377 | en_US |
dc.citation.epage | 386 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1994NH00300003 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |