Using Error-Correcting Codes for Text Classification
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Evolutionary On-line Learning of Cooperative Behavior with Situation-Action-Pairs
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
The maximum flow problem: a real-time approach
Parallel Computing
Superlinear Performance in Real-Time Parallel Computation
The Journal of Supercomputing
Improving Modeling of Other Agents Using Stereotypes and Compactification of Observations
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 0.00 |
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples into a predefined set of categories. These two applications are investigated under real-time constraints, when the deadlines imposed can dramatically alter the quality of the solution unless a parallel model of computation (in these cases, a linear array of processors) is used. We also study a class of real-time computations, referred to as reactive real-time systems, that are particularly sensitive to the first time constraint imposed.