@techreport{
 title = {Mobile agents: Motivations and State of the Art},
 type = {techreport},
 year = {2000},
 keywords = {dartmouth-cs,mobile-agent,mobile-computing,survey},
 issue = {TR2000-365},
 websites = {http://www.cs.dartmouth.edu/~dfk/papers/gray-motivation-tr.pdf},
 institution = {Dartmouth Computer Science},
 id = {054e9cd3-f8ec-3623-bbe5-51f108b90935},
 created = {2018-07-12T21:31:18.035Z},
 file_attached = {false},
 profile_id = {f954d000-ce94-3da6-bd26-b983145a920f},
 group_id = {b0b145a3-980e-3ad7-a16f-c93918c606ed},
 last_modified = {2018-07-12T21:31:18.035Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {gray:motivation-tr},
 source_type = {techreport},
 private_publication = {false},
 abstract = {A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. On each machine, the agent interacts with stationary service agents and other resources to accomplish its task. In this chapter, we first make the case for mobile agents, discussing six strengths of mobile agents and the applications that benefit from these strengths. Although none of these strengths are unique to mobile agents, no competing technique shares all six. In other words, a mobile-agent system provides a single general framework in which a wide range of distributed applications can be implemented efficiently and easily. We then present a representative cross-section of current mobile-agent systems.},
 bibtype = {techreport},
 author = {Gray, Robert S and Cybenko, George and Kotz, David and Rus, Daniela}
}

{"_id":"h3Z6PWAomgeJvzaKb","bibbaseid":"gray-cybenko-kotz-rus-mobileagentsmotivationsandstateoftheart-2000","downloads":0,"creationDate":"2019-02-15T15:14:58.741Z","title":"Mobile agents: Motivations and State of the Art","author_short":["Gray, R., S.","Cybenko, G.","Kotz, D.","Rus, D."],"year":2000,"bibtype":"techreport","biburl":null,"bibdata":{"title":"Mobile agents: Motivations and State of the Art","type":"techreport","year":"2000","keywords":"dartmouth-cs,mobile-agent,mobile-computing,survey","issue":"TR2000-365","websites":"http://www.cs.dartmouth.edu/~dfk/papers/gray-motivation-tr.pdf","institution":"Dartmouth Computer Science","id":"054e9cd3-f8ec-3623-bbe5-51f108b90935","created":"2018-07-12T21:31:18.035Z","file_attached":false,"profile_id":"f954d000-ce94-3da6-bd26-b983145a920f","group_id":"b0b145a3-980e-3ad7-a16f-c93918c606ed","last_modified":"2018-07-12T21:31:18.035Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"gray:motivation-tr","source_type":"techreport","private_publication":false,"abstract":"A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. On each machine, the agent interacts with stationary service agents and other resources to accomplish its task. In this chapter, we first make the case for mobile agents, discussing six strengths of mobile agents and the applications that benefit from these strengths. Although none of these strengths are unique to mobile agents, no competing technique shares all six. In other words, a mobile-agent system provides a single general framework in which a wide range of distributed applications can be implemented efficiently and easily. We then present a representative cross-section of current mobile-agent systems.","bibtype":"techreport","author":"Gray, Robert S and Cybenko, George and Kotz, David and Rus, Daniela","bibtex":"@techreport{\n title = {Mobile agents: Motivations and State of the Art},\n type = {techreport},\n year = {2000},\n keywords = {dartmouth-cs,mobile-agent,mobile-computing,survey},\n issue = {TR2000-365},\n websites = {http://www.cs.dartmouth.edu/~dfk/papers/gray-motivation-tr.pdf},\n institution = {Dartmouth Computer Science},\n id = {054e9cd3-f8ec-3623-bbe5-51f108b90935},\n created = {2018-07-12T21:31:18.035Z},\n file_attached = {false},\n profile_id = {f954d000-ce94-3da6-bd26-b983145a920f},\n group_id = {b0b145a3-980e-3ad7-a16f-c93918c606ed},\n last_modified = {2018-07-12T21:31:18.035Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {gray:motivation-tr},\n source_type = {techreport},\n private_publication = {false},\n abstract = {A mobile agent is an executing program that can migrate, at times of its own choosing, from machine to machine in a heterogeneous network. On each machine, the agent interacts with stationary service agents and other resources to accomplish its task. In this chapter, we first make the case for mobile agents, discussing six strengths of mobile agents and the applications that benefit from these strengths. Although none of these strengths are unique to mobile agents, no competing technique shares all six. In other words, a mobile-agent system provides a single general framework in which a wide range of distributed applications can be implemented efficiently and easily. We then present a representative cross-section of current mobile-agent systems.},\n bibtype = {techreport},\n author = {Gray, Robert S and Cybenko, George and Kotz, David and Rus, Daniela}\n}","author_short":["Gray, R., S.","Cybenko, G.","Kotz, D.","Rus, D."],"urls":{"Website":"http://www.cs.dartmouth.edu/~dfk/papers/gray-motivation-tr.pdf"},"bibbaseid":"gray-cybenko-kotz-rus-mobileagentsmotivationsandstateoftheart-2000","role":"author","keyword":["dartmouth-cs","mobile-agent","mobile-computing","survey"],"downloads":0},"search_terms":["mobile","agents","motivations","state","art","gray","cybenko","kotz","rus"],"keywords":["dartmouth-cs","mobile-agent","mobile-computing","survey","mobile computing"],"authorIDs":["5c66d9b9e4b1db10000001ba","5c69efe6ac591010000000e0"]}