Partitioning activities for agents

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 1218-1223

  Özcan, Fatma ^a   Subrahmanian, V S ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ACTIVITIES; CONCURRENT REQUESTS; GREEDY ALGORITHMS; NP-HARD; OPTIMAL PARTITIONS; OPTIMAL SOLUTIONS; SUBOPTIMAL SOLUTION;

ARTIFICIAL INTELLIGENCE; LINEAR PROGRAMMING;

ALGORITHMS;

EID: 79956297744     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. S. Adali, K. Candan, Y. Papakonstantinou, and V. S. Subrahmanian. Query caching and optimization in distributed mediator systems. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 137-148, Montreal, Canada, June 1996.
2. Y. Arens, C. Y. Chee, C.-N. Hsu, and C. Knoblock. Retrieving and integrating data from multiple information sources. International Journal of Intelligent Cooperative Information Systems, 2(2):127-158, 1993.
3. Naveen Ashish, Craig A. Knoblock, and Cyrus Shahabi. Selectively materializing data inmediators by analyzing user queries. In Proceedings of the 4th IFCIS International Conference on Cooperative Information Systems, (CoopIS), pages 256-266, Edinburgh, Scotland, September 1999.
4. R. Bayardo et al. Infosleuth: Agent-based Semantic Integration of Information in Open and Dynamic Environments. In J. Peckham, editor, Proceedings of ACM SIGMOD Conference on Management of Data, pages 195-206, Tucson, Arizona, 1997.
5. K. Decker, K. Sycara, and M. Williamson. Middle Agents for the Internet. In IJCAI, pages 578-583, Nagoya, Japan, 1997.
6. O. Etzioni and D. Weld. A softbot-based interface to the internet. Communications of the ACM, 37(7):72-76, 1994.
7. H. Kellerer. A polynomial time approximation scheme for the multiple knapsack problem. In Proceedings of APPROX'99, volume 1671 of Lecture Notes in Computer Science, pages 51-62, Berkeley, CA, 1999.
8. S. Martello and P. Toth. Algorithms for knapsack problems. In S. Martello, G. Laporte, M. Minoux, and C. Ribeiro, editors, Annals of Discrete Mathematics 31: Surveys in Combinatorial Optimization. North-Holland, 1987.
9. N. J. Nilsson. Principles of Artificial Intelligence. Morgan Kaufmann Publishers, 1986.
10. R. Schwartz and S. Kraus. Bidding Mechanisms for Data Allocation in Multi-Agent Environments. In Intl. Workshop on Agent Theories, Architectures, and Languages, pages 56-70, Providence, RI, 1997.
11. K. Shim, T. K. Sellis, and D. Nau. Improvements on a heuristic algorithm for multiple-query optimization. Data and Knowledge Engineering, 12(2):197-222, 1994.
12. Q. Yang, D. Nau, and J. Hendler. Merging separately generated plans with restricted interactions. Computational Intelligence, 8(2):648-676, 1992.