Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Tadashi Ae"'
Publikováno v:
Systems and Computers in Japan. 30:34-40
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7465b08950c28e3804ed936c6e8b5b7
https://doi.org/10.1002/(sici)1520-684x(199909)30:10<34::aid-scj4>3.0.co
https://doi.org/10.1002/(sici)1520-684x(199909)30:10<34::aid-scj4>3.0.co
Publikováno v:
Systems and Computers in Japan. 27:101-109
Yao et al. have proposed the Dynamic-Static Neural network (DS-net) which includes the Tank and Hopfield model for linear programming problems as its special case. This paper proposes a modified DS-net which is capable of solving optimization problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1cda52e2dc3cce2fbb3cff0b2b99826
https://doi.org/10.1002/scj.4690270110
https://doi.org/10.1002/scj.4690270110
Publikováno v:
Information Processing Letters. 49:213-218
The concept of k-coterie is introduced and a distributed k-mutual exclusion algorithm is proposed using it. A k-coterie is a natural extension of a coterie. The message complexity of the algorithm is O(c) when conflicts with other processes in captur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3bf41130f4a455cfc2912300e862f81
https://doi.org/10.1016/0020-0190(94)90014-0
https://doi.org/10.1016/0020-0190(94)90014-0
Publikováno v:
Systems and Computers in Japan. 25:78-87
This paper proposes a speed improvement of the error back propagation algorithm which is employed widely in the. multilayered neural network by introducing the prediction. The idea is to realize a larger acceleration by introducing the differential f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de4ca8b0443e0f0d96c9e7577cb45806
https://doi.org/10.1002/scj.4690250107
https://doi.org/10.1002/scj.4690250107
Publikováno v:
IEEE Transactions on Computers. 42:553-558
The distributed k-mutual-exclusion problem (k-mutex problem) is the problem of guaranteeing that at most k processes at a time can enter a critical section at a time in a distribution system. A method proposed for the solution of the distributed mutu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a24d9cd0ef3aef44dd2e99d588f8ca46
https://doi.org/10.1109/12.223674
https://doi.org/10.1109/12.223674
Publikováno v:
AIP Conference Proceedings.
We discuss a new model for concept based on topological learning, where the learning process on the neural network is represented by mathematical topology. The topological learning of neural networks is summarized by a quotient of input space and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d65f700bf61085bd686ab39dda644713
https://doi.org/10.1063/1.3527156
https://doi.org/10.1063/1.3527156
Publikováno v:
Systems and Computers in Japan. 22:10-18
The leader election problem is a problem of determining a unique leader, in the sense that the elected leader knows that it is elected and the processors which are not elected know that they are not elected. Under the assumption that the processors h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aabf0804d8f22db5e0b8a3f4a8287440
https://doi.org/10.1002/scj.4690220302
https://doi.org/10.1002/scj.4690220302
Publikováno v:
Systems and Computers in Japan. 22:88-95
The Hopfield neural network is attracting attention as a high-speed solver for optimization and other problems. However, it contains a problem in that the network may not arrive at the globally optimal solution but stops at a locally optimal solution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e43bd0a52d10094d710e863173ae326
https://doi.org/10.1002/scj.4690221010
https://doi.org/10.1002/scj.4690221010
Autor:
Tadashi Ae, Reiji Aibara
Publikováno v:
Real-Time Systems. 1:351-363
In real-time systems, the scheduling plays an important role to carry out all tasks within predefined time frames. The scheduling problem, however, is known to be intractable, that is, NP-hard or NP-complete for most cases (Garey and Johnson 1979). I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8c20a7de62a424c136e5444a8c2a102
https://doi.org/10.1007/bf00366575
https://doi.org/10.1007/bf00366575
Autor:
Tadashi Ae, Motoki Kamitani
Publikováno v:
AIP Conference Proceedings.
Evolutionary computation is an anticipatory computation for generation of creative sets including the set of sequences. The Interactive Evolutionary Computation (IEC, in short) is known as one of evolutionary computations, but it is not necessarily e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::940fa01ae8a1f64d670e80039e8b4271
https://doi.org/10.1063/1.2216651
https://doi.org/10.1063/1.2216651