Masahiro Yamauchi

According to our database1, Masahiro Yamauchi authored at least 10 papers between 1993 and 2013.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2009
Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2006
An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

2005
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2001
Two efficient methods for computing Petri net invariants.
Proceedings of the IEEE International Conference on Systems, 2001

1999
A heuristic algorithm SDS for scheduling with timed Petri nets.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

1998
A heuristic algorithm FSD for the legal firing sequence problem of Petri nets.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

Extracting siphons containing a specified set of places in a Petri net.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1994
An Approximation Algorithm for the Legal Firing Sequence Problem of Petri Nets.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

1993
New Priority-Lists for Scheduling in Timed Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1993, 1993


  Loading...