Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference38 articles.
1. Arora, S. (1998). The Approximability of NP-hard Problems. This survey was a plenary lecture at ACM Symposium on Theory of Computing.
2. Baker, A. D. (1998). A survey of factory control algorithms that can be implemented in a multi-agent heterarchy: Dispatching, scheduling, and pull. Journal of Manufacturing Systems, 17(4), 297–320.
3. Baker, A. D., Van Dyke Parunak, H., & Erol K. (1999). Agents and the internet: Infrastructure: Mass customisation. IEEE Internet Computing, 3(5), Sept.–Oct. 62–69.
4. Beck, J. C. (1994). A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimisation, MSc Thesis, University of Toronto.
5. Bogan, N. R. (1994). Economic allocation of computation time with computational markets. In Master Thesis, Department of Electrical Engineering and Computer Science, MIT.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献