Freitas, Alex A., Kirner, C. (1993) Tailoring A* for a massively parallel machine: application to the traveling salesman problem. In: Proc I Simp Brasileiro em Automacao Inteligente. . pp. 371-380. , Rio Claro - SP< Brazil: UNESP (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:21104)
| The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. |
| Item Type: | Conference or workshop item (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 11 Aug 2009 17:03 UTC |
| Last Modified: | 05 Nov 2024 09:58 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21104 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Freitas, Alex A..
| Creator's ORCID: |
 https://orcid.org/0000-0001-9825-4700
|
|---|---|
| CReDIT Contributor Roles: |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
