File Download
Supplementary
-
Citations:
- Appears in Collections:
postgraduate thesis: Two results in algorithm design: finding least-weight subsequences with fewer processors and traversing anobstacle-spread terrain without a map
| Title | Two results in algorithm design: finding least-weight subsequences with fewer processors and traversing anobstacle-spread terrain without a map |
|---|---|
| Authors | |
| Issue Date | 1991 |
| Publisher | The University of Hong Kong (Pokfulam, Hong Kong) |
| Citation | Chan, K. [陳廣輝]. (1991). Two results in algorithm design : finding least-weight subsequences with fewer processors and traversing an obstacle-spread terrain without a map. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120957 |
| Degree | Master of Philosophy |
| Subject | Algorithms. Computer programming. |
| Dept/Program | Computer Science |
| Persistent Identifier | http://hdl.handle.net/10722/32352 |
| HKU Library Item ID | b3120957 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chan, Kwong-fai. | - |
| dc.contributor.author | 陳廣輝 | - |
| dc.date.issued | 1991 | - |
| dc.identifier.citation | Chan, K. [陳廣輝]. (1991). Two results in algorithm design : finding least-weight subsequences with fewer processors and traversing an obstacle-spread terrain without a map. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120957 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/32352 | - |
| dc.language | eng | - |
| dc.publisher | The University of Hong Kong (Pokfulam, Hong Kong) | - |
| dc.relation.ispartof | HKU Theses Online (HKUTO) | - |
| dc.rights | The author retains all proprietary rights, (such as patent rights) and the right to use in future works. | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.source.uri | http://hub.hku.hk/bib/B31209579 | - |
| dc.subject.lcsh | Algorithms. | - |
| dc.subject.lcsh | Computer programming. | - |
| dc.title | Two results in algorithm design: finding least-weight subsequences with fewer processors and traversing anobstacle-spread terrain without a map | - |
| dc.type | PG_Thesis | - |
| dc.identifier.hkul | b3120957 | - |
| dc.description.thesisname | Master of Philosophy | - |
| dc.description.thesislevel | Master | - |
| dc.description.thesisdiscipline | Computer Science | - |
| dc.description.nature | published_or_final_version | - |
| dc.identifier.doi | 10.5353/th_b3120957 | - |
| dc.date.hkucongregation | 1991 | - |
| dc.identifier.mmsid | 991012181639703414 | - |