Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/5756Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Boukala, M. Cherif | - |
| dc.date.accessioned | 2020-03-12T13:59:00Z | - |
| dc.date.available | 2020-03-12T13:59:00Z | - |
| dc.date.issued | 1991 | - |
| dc.identifier.uri | http://di.univ-blida.dz:8080/jspui/handle/123456789/5756 | - |
| dc.description | Bibliogr. 60 p. ill. | fr_FR |
| dc.language.iso | fr | fr_FR |
| dc.publisher | univ- blida 1 | fr_FR |
| dc.subject | Algorithmes | fr_FR |
| dc.subject | Parallélisation | fr_FR |
| dc.title | Parallélisation des algorithmes Branch an D Bound | fr_FR |
| dc.type | Thesis | fr_FR |
| Appears in Collections: | Thèses de Magister | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 32.004.6.1.pdf | Thèse de Magister | 19,51 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.