Search Results - "Nagamatu, M."

On the stability of Lagrange programming neural networks for satisfiability problems of propositional calculus by Nagamatu, M, Yanaru, T

“…The Hopfield type neural networks for solving difficult combinatorial optimization problems have used the gradient descent algorithms to solve constrained…”
Get full text

Geant4—a simulation toolkit by Agostinelli, S., Allison, J., Amako, K., Apostolakis, J., Araujo, H., Arce, P., Asai, M., Axen, D., Banerjee, S., Barrand, G., Behner, F., Bellagamba, L., Boudreau, J., Broglia, L., Brunengo, A., Burkhardt, H., Chauvie, S., Chuma, J., Chytracek, R., Cooperman, G., Cosmo, G., Degtyarenko, P., Dell'Acqua, A., Depaola, G., Dietrich, D., Enami, R., Feliciello, A., Ferguson, C., Fesefeldt, H., Folger, G., Foppiano, F., Forti, A., Garelli, S., Giani, S., Giannitrapani, R., Gibin, D., Gómez Cadenas, J.J., González, I., Gracia Abril, G., Greeniaus, G., Greiner, W., Grichine, V., Grossheim, A., Guatelli, S., Gumplinger, P., Hamatsu, R., Hashimoto, K., Hasui, H., Heikkinen, A., Howard, A., Ivanchenko, V., Johnson, A., Jones, F.W., Kallenbach, J., Kanaya, N., Kawabata, M., Kawabata, Y., Kawaguti, M., Kelner, S., Kent, P., Kimura, A., Kodama, T., Kokoulin, R., Kossov, M., Kurashige, H., Lamanna, E., Lampén, T., Lara, V., Lefebure, V., Lei, F., Liendl, M., Lockman, W., Longo, F., Magni, S., Maire, M., Medernach, E., Minamimoto, K., Mora de Freitas, P., Morita, Y., Murakami, K., Nagamatu, M., Nartallo, R., Nieminen, P., Nishimura, T., Ohtsubo, K., Okamura, M., O'Neale, S., Oohata, Y., Paech, K., Perl, J., Pfeiffer, A., Pia, M.G., Ranjard, F., Rybin, A., Sadilov, S., Di Salvo, E., Santin, G., Sasaki, T., Savvas, N., Sawada, Y.

Get full text

An evaluation of nutritional status of vitamin E in pregnant women with respect to red blood cell tocopherol level by Mino, M, Nagamatu, M

“…Changes in RBC tocopherol level as an index for vitamin E status were studied in relation to plasma levels of tocopherol and lipids during pregnancy. Plasma…”
Get more information

Two families of Charcot-Marie-Tooth disease with Adie's pupil, axonal neuropahy and the Thr124Met mutation in the peripheral myelin protein zero gene by Misu, K, Yoshihara, T, Yamamoto, M, Hattori, N, Nagamatu, M, Mukai, E, Takegami, T, Sobue, G

“…We reported two families of Charcot-Marie-Tooth disease (CMT) with Thr124Met mutation in the peripheral myelin protein zero (MPZ). The clinical features of the…”
Get more information

Test generation by Lagrange programming neural network by Nagamatu, M., Yanaru, T.

“…A neural network approach for test generation of single stuck-at faults in combinational circuits has been proposed by Chakradhar et al. (1991). The network is…”
Get full text

A continuous valued iterative algorithm for wire routing problems by Nagamatu, M., Ismail, S., Yanaru, T.

“…A continuous valued iterative algorithm LMR-FSC for wire routing problems is proposed. In this method, each wire is a non-discrete one (discrete means binary…”
Get full text

On the stability of Lagrange programming neural networks for satisfiability problems of prepositional calculus by Nagamatu, M., Yanaru, T.

“…The Hopfield type neural networks for solving difficult combinatorial optimization problems have used the gradient descent algorithms to solve constrained…”
Get full text

Solving warehouse location problem by Lagrange programming neural network by Nakano, T., Nagamatu, M.

“…The LPPH-CSP is a neural network for solving the constraint satisfaction problem (CSP), which is a combinatorial problem to find a solution which satisfies all…”
Get full text

Solving SAT by parallel execution of neural networks with probabilistic attenuation coefficient generator by Zhang, K., Nagamatu, M.

“…We have proposed a neural network named LPPH for the SAT. In order to solve the SAT more efficiently, a parallel execution has been proposed. Experimental…”
Get full text

Constraint satisfaction problems and neurocomputing by Nagamatu, Masahiro, Nakano, Takahiro, Zhang, Kairong

“…CSP is an important problem in computer science. However, the CSP is also a well-known NP-complete problem. Local search, which is a representative of…”
Get full text

G eant4—a simulation toolkit by Agostinelli, S., Allison, J., Amako, K., Apostolakis, J., Araujo, H., Arce, P., Axen, D., Banerjee, S., Barrand, G., Behner, F., Bellagamba, L., Boudreau, J., Broglia, L., Brunengo, A., Burkhardt, H., Chauvie, S., Chytracek, R., Cooperman, G., Cosmo, G., Degtyarenko, P., Dell'Acqua, A., Dietrich, D., Feliciello, A., Ferguson, C., Fesefeldt, H., Folger, G., Foppiano, F., Forti, A., Garelli, S., Giani, S., Giannitrapani, R., Gibin, D., Gómez Cadenas, J.J., González, I., Greeniaus, G., Grichine, V., Grossheim, A., Guatelli, S., Gumplinger, P., Hamatsu, R., Hashimoto, K., Heikkinen, A., Howard, A., Ivanchenko, V., Johnson, A., Jones, F.W., Kanaya, N., Kawabata, Y., Kawaguti, M., Kelner, S., Kodama, T., Kokoulin, R., Kossov, M., Kurashige, H., Lamanna, E., Lampén, T., Lara, V., Lefebure, V., Lockman, W., Longo, F., Magni, S., Maire, M., Minamimoto, K., Mora de Freitas, P., Murakami, K., Nartallo, R., Nieminen, P., Ohtsubo, K., Okamura, M., O'Neale, S., Oohata, Y., Paech, K., Perl, J., Pfeiffer, A., Ranjard, F., Sadilov, S., Sasaki, T., Savvas, N., Sawada, Y., Sei, S., Sirotenko, V., Smith, D., Starkov, N., Stoecker, H., Sulkimo, J., Takahata, M., Tanaka, S., Safai Tehrani, E., Truscott, P., Uno, H., Urban, L., Urban, P., Verderi, M., Wander, W., Wellisch, J.P., Wenaus, T., Williams, D.C., Wright, D., Yamada, T., Yoshida, H.

“…G eant4 is a toolkit for simulating the passage of particles through matter. It includes a complete range of functionality including tracking, geometry,…”
Get full text

Lagrangian method for solving Software-MCU assignment problem in car electronic system design by Weerasinghe, J., Nagamatu, M.

“…In this paper, we address the Software-MCU (Micro Controller Unit) assignment problem in car electronic system design. This is a difficult optimization problem…”
Get full text

Lagrangian method for satisfiability problems of propositional calculus by Nagamatu, M., Yanaru, T.

“…Hopfield type neural networks for solving difficult combinatorial optimization problems have used gradient descent algorithms to solve constrained optimization…”
Get full text

Extensions of Lagrange programming neural network for satisfiability problem and its several variations by Nagamatu, M., Nakano, T., Hamada, N., Kido, T., Akahoshi, T.

“…The satisfiability problem (SAT) of the propositional calculus is a well-known NP-complete problem. It requires exponential computation time as the problem…”
Get full text

Lagrangian method for wire routing of layout design by Nagamatu, M., Ismail, S., Yanaru, T.

“…In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All…”
Get full text

A 320 Mflops Cmos Floating-point Processing Unit For Superscalar Processors by Ide, N., Fukuhisa, H., Kondo, Y., Yoshida, T., Nagamatu, M., Mori, J., Yamazaki, I., Ueno, K.

Get full text

Wire routing by Lagrangian method by Nagamatu, M., Ismail, S., Shinji, R., Yanaru, T.

“…Routing problems have been formulated as discrete optimization problems. The maze router has been widely used because of its ability to find a shortest path…”
Get full text