Cooperate processing units using stored cooperation problem...

Electrical computers and digital processing systems: multicomput – Distributed data processing – Processing agent

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S100000, C718S102000

Reexamination Certificate

active

07016934

ABSTRACT:
A mobile agent mediates cooperation among schedulers by executing a cooperation protocol. For heuristics such as strategies and the order in which variables are decided, which are used as criteria of selecting the value of a variable from candidates, when the heuristics are to be built into a solving method of a constraint satisfaction problem, processes with regard to these heuristics are so substantially localized as to be capable of parallel execution. These processes capable of parallel execution, as autonomous operations of different mobile agents, can be under modeling in natural form, resulting in easy installation. This facilitates software construction for reflecting the heuristics in a solving method of a constraint satisfaction problem, as well as improves the maintainability and extendibility of software.

REFERENCES:
patent: 5872972 (1999-02-01), Boland et al.
patent: 5944783 (1999-08-01), Nieten
patent: 6012152 (2000-01-01), Douik et al.
patent: 6065039 (2000-05-01), Paciorek
patent: 6092099 (2000-07-01), Irie et al.
patent: 6134580 (2000-10-01), Tahara et al.
patent: 6148327 (2000-11-01), Whitebread et al.
patent: 6226666 (2001-05-01), Chang et al.
patent: 05-238455 (1993-09-01), None
patent: 07-242940 (1995-09-01), None
“The DARPA Knowledge Sharing Effort : Progress Report” by ¥bibitem{DARPA} Paaatil, P.S., Fikes, R.E., Patel-Schneider, R.E., Macay, D., Finin, T., Gruber, T.R. and Neches, R., Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 1992.
“Mobile Agent Technology Implementing Network Society” by Shiniti Motoida, Takashi Moriyasu, Takahiro Kawamura, Toshiba review, vol. 53, No. 8, pp. 2-6, Aug. 1998.
“JAFMAS : A JAVA-based Agent Framework for Multiagent Systems Development and Implementation” by Chauhan, D., phD thesis, ECECS Department, University of Cincinnati, 1997.
Sycara, K.P, Sadeh, N. and Fox, M.S., “Distributed constrained heuristics search”, IEEE Transactions on Systems, Man And Cybernetics, vol. 21, No. 6, pp. 1446-1461, 1991.
Sycara, K.P, Roth, S.F., Sadeh, N. and Fox, M.S., “Resource Allocation in Distributed Factory Scheduling”, IEEE Expert, vol. 6, No. 1, pp. 29-40, 1991.
Barbuceanu, M. and Fox, M.S., “Cool : A language for describing coordination in multi agent systems,” Proceedings of the First International Conference on Multi-Agent Systems, pp. 17-24, 1995.
Genesereth, M., et al., “Software Agents,” Special issue on Intelligent Agents, Communication of the ACM, vol. 37, No. 7, pp. 48-53, Jul. 1994.
“Knowledge Sharing and Reuse by Cooperative Architecture,” Nishida, Toyoaki, Jan. 1994.
Shinichi Honiden, “Mobile Agents Technology—Software Technology for Network Computing,” Sep. 15, 1998, pp. 228-233 (English Abstract only).
Takahiro Kawamura et al., “An Approach to Distributed Constraint Satisfaction Problems by Using Mobile Agents—Development of Distributed Cooperative Power Outage Scheduling System,” IEICE Technical Report, vol. 98, No. 58, May 21, 1998, pp. 15-22 (English Abstract only).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Cooperate processing units using stored cooperation problem... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cooperate processing units using stored cooperation problem..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperate processing units using stored cooperation problem... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3564725

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.