default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasahiro Nagamatu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[p1]Shinji Nagano, Yoichi Fujimoto, Masahiro Nagamatu:
Constraint Satisfaction with Neural Network for Trajectory Planning. Brain-Inspired Information Technology 2010: 69-72
2000 – 2009
- 2009
- [c14]Masahiro Nagamatu, Jagath Weerasinghe:
Using Long and Short Term Memories in Solving Optimization Problems. ICONIP (2) 2009: 457-464 - 2008
- [c13]Yuya Nishida, Masahiro Nagamatu:
Trajectory Planning with Dynamics Constraints for an Underactuated Manipulator. ICONIP (1) 2008: 787-793 - 2006
- [j3]Takahiro Nakano, Masahiro Nagamatu:
A Continuous Valued Neural Network with a New Evaluation Function of Degree of Unsatisfaction for Solving CSP. IEICE Trans. Inf. Syst. 89-D(4): 1555-1562 (2006) - [c12]Masahiro Nagamatu, Kairong Zhang:
Parallel execution of state space explorations using different kinds of dynamics. Computational Intelligence 2006: 180-185 - 2005
- [j2]Kairong Zhang, Masahiro Nagamatu:
Using Attenuation Coefficient Generating Function in Parallel Execution of Neural Networks for Solving SAT. J. Adv. Comput. Intell. Intell. Informatics 9(2): 121-126 (2005) - [c11]Takahiro Nakano, Masahiro Nagamatu:
Lagrange Neural Network for Solving CSP Which Includes Linear Inequality Constraints. ICANN (2) 2005: 943-948 - [c10]Kairong Zhang, Masahiro Nagamatu:
Solving Satisfiability Problem by Parallel Execution of Neural Networks with Biases. ICANN (2) 2005: 969-974 - 2004
- [c9]Takahiro Nakano, Masahiro Nagamatu:
Solving CSP by Lagrangian Method with Importance of Constraints. Intelligent Information Processing 2004: 255-258 - [c8]Kairong Zhang, Masahiro Nagamatu:
Mixed Parallel Execution of Algorithms for Satisfiability Problem. Intelligent Information Processing 2004: 273-277
1990 – 1999
- 1999
- [c7]Masahiro Nagamatu, Torao Yanaru:
Solving SAT by Lagrange Programming Neural Network with Long and Short Term Memories. EJC 1999: 289-301 - 1998
- [c6]Masahiro Nagamatu, Torao Yanaru:
Parallel State Space Search for SAT with Lagrange Programming Neural Network. ICONIP 1998: 767-770 - [c5]Shakeel Ismail, Masahiro Nagamatu, Torao Yanaru:
Largrange Programming Neural Network for Wire Routing Problem. ICONIP 1998: 999-1003 - [c4]Masahiro Nagamatu, Torao Yanaru:
Test generation by Lagrange programming neural network. KES (1) 1998: 341-347 - [c3]Masahiro Nagamatu, Shakeel Ismail, Torao Yanaru:
A continuous valued iterative algorithm for wire routing problems. KES (1) 1998: 348-357 - 1996
- [j1]Masahiro Nagamatu, Torao Yanaru:
On the stability of Lagrange programming neural networks for satisfiability problems of propositional calculus. Neurocomputing 13(2-4): 119-133 (1996) - 1995
- [c2]Masahiro Nagamatu, Torao Yanaru:
Lagrangian Method for Satisfiability Problems of Propositional Calculus. ANNES 1995: 71-74 - [c1]Masahiro Nagamatu, Shakeel Ismail, Torao Yanaru:
Lagrangian method for wire routing of layout design. ANNES 1995: 350-354
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
