S.Narazaki, H.Yamamura and N.Yoshida, Strategies for Selecting communication structures in Cooperative Search. International J. of Cooperative Information Systems, 4(4):405-422, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multitarget Motion Analysis by Cooperative Mutiagent System.. - Chen, Tokuda (Correct)
....respectively. keywords Cooperative distributed vision, data associate problem, multitarget motion tracking 1. Introduction Multitarget tracking from bearings only measurements under a distributed sensor network is a hard inverse problem [13] In spite of extensive research work on the subject[1, 2, 8], the problem remains unsolved because it is shown that the static data assignment problems with more than three sensors is an NP hard problem [6, 7] The difficulty increases perhaps beyond an exponential complexity if the number of targets, the number of sensors and the number of sampling scans ....
....by unnecessarily complex algorithms which are most easily trapped by local minima. Much progress has been reported in resolving a local minimum entrapping problem including methods of simulated annealing, and neural computing to help obtain a global minimum. A distributed cooperative search [8] offers a new approach to obtain a global minimum in multidimensional space having multiple local minimal functions. Unlike a centralized processing system where all of the sensor measured data are processed by a single central processor, in the distributed cooperative approach [9, 10, 12] all ....
[Article contains additional citation context not shown here]
S.Narazaki, H.Yamamura and N.Yoshida, Strategies for Selecting communication structures in Cooperative Search. International J. of Cooperative Information Systems, 4(4):405-422, 1995.
Multitarget Tracking by Distributed Cooperative Processing.. - Chen, Tokuda (Correct)
....respectively. keywords Cooperative distributed vision, data associate problem, multitarget motion tracking 1. Introduction Multitarget tracking from bearings only measurements under a distributed sensor network is a hard inverse problem [13] In spite of extensive research work on the subject[1, 2, 8], the problem remains unsolved because it is shown that the static data assignment problems with more than three sensors is an NP hard problem [6, 7] The difficulty increases perhaps beyond an exponential complexity if the number of targets, the number of sensors and the number of sampling scans ....
....by unnecessarily complex algorithms which are most easily trapped by local minima. Much progress has been reported in resolving a local minimum entrapping problem including methods of simulated annealing, and neural computing to help obtain a global minimum. A distributed cooperative search [8] offers a new approach to obtain a global minimum in multidimensional space having multiple local minimal functions. Unlike a centralized processing system where all of the sensor measured data are processed by a single central processor, in the distributed cooperative approach [9, 10, 12] all ....
[Article contains additional citation context not shown here]
S.Narazaki, H.Yamamura and N.Yoshida, Strategies for Selecting communication structures in Cooperative Search. International J. of Cooperative Information Systems, 4(4):405-422, 1995.
Dynamic Multi-Server Reconfiguration Using Meta-Level.. - Toshihiko Shimokawa.. Self-citation (Narazaki Yoshida) (Correct)
....information sharing system must be adaptive. The system must watch the transition of the access pattern, and adjust parameters or even switch protocols to optimize communication accordingly by itself. This is especially the case in parallel artificial intelligence systems and multi agent systems [2]. We proposed a dynamic adaptation scheme for distributed information sharing [3] The system monitors the access pattern to a shared data, and accordingly adjusts itself in an adaptive manner. The essence of our idea is simple. According to the read write ratio to the shared data, there is an ....
S. Narazaki, H. Yamamura and N. Yoshida, "Strategies for Selecting Communication Structures in Cooperative Search", Int'l J. of Cooperative Information Systems, 4:4, 405-422 (1995)
Dynamic Copy Allocation Scheme for Distributed Resource.. - Shuji Narazaki (1998) Self-citation (Narazaki Yoshida) (Correct)
....environments, a DSM system must be adaptive. The system must watch the transition of the access pattern, and adjust parameters or even switch protocols to optimize communication accordingly by itself. This is especially the case in parallel artificial intelligence systems and multi agent systems [1]. This paper presents a dynamic adaptation scheme for distributed resource sharing. The system monitors the access pattern to a shared data, and accordingly determines the number and allocation of copies (replicas) of the data dynamically and automatically. This paper also presents the system ....
Shuji Narazaki, Hiroomi Yamamura and Norihiko Yoshida, "Strategies for Selecting Communication Structures in Cooperative Search", Int'l Journal of Cooperative Information Systems, 4:4, 405--422 (1995)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC