VOTING METHODS FOR MULTIPLE AUTONOMOUS AGENTS
dc.contributor.author | Parker, J.R. | eng |
dc.date.accessioned | 2008-05-08T18:41:27Z | |
dc.date.available | 2008-05-08T18:41:27Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1995-04-01 | eng |
dc.description.abstract | The use of many diverse algorithms simultaneously applied to a single problem improves the robustness of the solution. This is certainly true of handprinted character recognition. The problem addressed here is that of combining the results from many agents to give a single result that represents a synthesis of the component agents. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1995-558-10 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30962 | |
dc.identifier.uri | http://hdl.handle.net/1880/46433 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | VOTING METHODS FOR MULTIPLE AUTONOMOUS AGENTS | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1