Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6352Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Kornfeld, William A. | - |
| dc.date | 2004-10-04T14:52:48Z | - |
| dc.date | 2004-10-04T14:52:48Z | - |
| dc.date | 1981-03-01 | - |
| dc.date.accessioned | 2013-10-09T02:44:56Z | - |
| dc.date.available | 2013-10-09T02:44:56Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-627 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6352 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | The role of parallel processing in heuristic search is examined by means of an example (cryptarithmetic addition). A problem solver is constructed that combines the metaphors of constraint propagation and hypothesize-and-test. The system is capable of working on many incompatible hypotheses at one time. Furthermore, it is capable of allocating different amounts of processing power to running activities and and changing these allocations as computation proceeds. It is empirically found that the parallel algorithm is, on the average, more efficient than a corresponding sequential one. Implications of this for problem solving in general are discussed. | - |
| dc.format | 5613932 bytes | - |
| dc.format | 3675451 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-627 | - |
| dc.title | The Use of Parallelism to Implement a Heuristic Search | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.