Keyword : heuristic algorithms


Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/02/01
Vol. E96-A  No. 2 ; pp. 540-553
Type of Manuscript:  Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)
Category: Algorithms and Data Structures
Keyword: 
timed Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF

The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms
Satoshi TAOKA Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2011/09/01
Vol. E94-A  No. 9 ; pp. 1833-1841
Type of Manuscript:  PAPER
Category: Concurrent Systems
Keyword: 
Petri netsmarking construction problemreachability problemheuristic algorithmscomputer experiments
 Summary | Full Text:PDF

Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
Satoru OCHIIWA Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/11/01
Vol. E92-A  No. 11 ; pp. 2732-2744
Type of Manuscript:  Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
Category: 
Keyword: 
Petri netslegal firing sequence problemsdeficient siphonsheuristic algorithmsperformance evaluation
 Summary | Full Text:PDF

Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs
Satoshi TAOKA Kazuya WATANABE Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/04/01
Vol. E89-A  No. 4 ; pp. 1049-1057
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
graphspartitioning problemsheuristic algorithmsoptimal algorithmsdemandsupply
 Summary | Full Text:PDF

Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets
Satoshi TAOKA Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/11/01
Vol. E88-A  No. 11 ; pp. 3051-3061
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: 
Keyword: 
Petri netsminimal initial marking problemslegal firing sequence problemsdeficient siphonsheuristic algorithmsexperimental evaluation
 Summary | Full Text:PDF

A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network
Der-Rong DIN Shian-Shyong TSENG 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2002/08/01
Vol. E85-B  No. 8 ; pp. 1533-1541
Type of Manuscript:  PAPER
Category: Terrestrial Radio Communications
Keyword: 
wireless ATMheuristic algorithmscell assignmenthandoff costcabling cost
 Summary | Full Text:PDF

On Finding Feasible Solutions for the Group Multicast Routing Problem
Chor Ping LOW Ning WANG 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2002/01/01
Vol. E85-B  No. 1 ; pp. 268-277
Type of Manuscript:  PAPER
Category: Network
Keyword: 
group multicast routingheuristic algorithmsbandwidth constraintNP-complete
 Summary | Full Text:PDF

A Genetic Approach for Maximum Independent Set Problems
Akio SAKAMOTO Xingzhao LIU Takashi SHIMAMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/03/25
Vol. E80-A  No. 3 ; pp. 551-556
Type of Manuscript:  Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
genetic Algorithmmaximum independent set problemmaximum clique problemheuristic algorithms
 Summary | Full Text:PDF

Design of Highly Reliable Optical Fiber Cable Network in Access Networks
Motoi IWASHITA Hisao OIKAWA Hideo IMANAKA Ryuji TOYOSHIMA 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 1995/07/25
Vol. E78-B  No. 7 ; pp. 1033-1042
Type of Manuscript:  PAPER
Category: Communication Networks and Service
Keyword: 
communication networks and servicesnetwork designreliabilityheuristic algorithmsaccess networks
 Summary | Full Text:PDF