Journal: Transactions of Information Processing Society of Japan

Found 4 papers in total
The maximum difference between the solution of the minimum cover problem and its relaxation problem
The maximum difference between the solution of the minimum cover problem and its relaxation problem
1999,
The minimum cover problem is a well-known NP complete one to choose a minimum number...
Multiobjective optimization using neighbourhood model genetic algorithms
Multiobjective optimization using neighbourhood model genetic algorithms
1999,
We propose a method of multiobjective optimization using genetic algorithms. The...
Scan-chain optimization methods for very large system integration
Scan-chain optimization methods for very large system integration
1999,
This paper presents a scan-chain optimization method for multiple scan-paths. The...
A neural network parallel algorithm for minimum maximal matching problems
A neural network parallel algorithm for minimum maximal matching problems
1998,
For a given graph G ( V, E ), a subset M of E is called a maximal matching of G if no...
Papers per page: