Journal: Transactions of the Institute of Electronics, Information and Communication Engineers

Found 134 papers in total
A parallel algorithm for finidng an st-shortest path in outerplanar graphs
A parallel algorithm for finidng an st-shortest path in outerplanar graphs
1995,
The st- shortest path problem of obtaining the shortest simple path between two given...
An efficient algorithm for drawing tree structured diagrams
An efficient algorithm for drawing tree structured diagrams
1996,
Various algorithms have been proposed for the problem of drawing rooted ordered trees....
Efficient algorithm for finding largest similar substructures in unordered trees
Efficient algorithm for finding largest similar substructures in unordered trees
1996,
This paper discusses the problems of finidng one of the largest similar substructures...
Comparisions of energy-descent optimization algorithms for maximum clique problems
Comparisions of energy-descent optimization algorithms for maximum clique problems
1996,
A clique of a graph G(V,E) is a subset of V such that every pair of vertices is...
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
1995,
This paper describes efficient algorithms for partitioning a k -edge-connected graph...
Metrics between trees embedded in a plane and their computing methods
Metrics between trees embedded in a plane and their computing methods
1996,
A tree embedded in a plane can be characterized as an unrooted and cyclically ordered...
A simple and efficient branch and bound algorithm for finding a maximum clique with the experimental evaluations
A simple and efficient branch and bound algorithm for finding a maximum clique with the experimental evaluations
1996,
The authors present a simple and efficient branch and bound recursive algorithm for...
Dynamic-Programming based one-dimensional 2-dimensional character-recognition algorithm with branched references
Dynamic-Programming based one-dimensional 2-dimensional character-recognition algorithm with branched references
1995,
A Dynamic Programming based elastic matching method called the Branched Reference...
Construction of Voronoi diagram on the upper half-plane
Construction of Voronoi diagram on the upper half-plane
1996,
The Voronoi diagram is the most fundamental and useful concept in computational...
An improved neural network for channel assignment problems in cellular mobile communication systems
An improved neural network for channel assignment problems in cellular mobile communication systems
1995,
This paper presents an improved neural network for channel assignment problems in...
An efficient parallel algorithm for the solution of block tridiagonal linear systems
An efficient parallel algorithm for the solution of block tridiagonal linear systems
1995,
A parallel overlapping preconditioner is applied to ICCG method and the effect of the...
Optimum design techniques for optoelectronic devices using simulated annealing
Optimum design techniques for optoelectronic devices using simulated annealing
1995,
Recently, an optimum design techniques for optoelectronic devices has been proposed....
Computational complexity of multicommodity flow problems with uniform assignment of flow
Computational complexity of multicommodity flow problems with uniform assignment of flow
1994,
This paper describes multicommodity flow problems with a flow assignment constraint....
A statistical method for testing-progress control based on a delayed S-shaped software reliability growth model
A statistical method for testing-progress control based on a delayed S-shaped software reliability growth model
1994,
In this letter, a statistical method for testing-progress control is proposed, which...
Optimal checkpointing procedures taking account of a system failure caused by checkpointing
Optimal checkpointing procedures taking account of a system failure caused by checkpointing
1995,
In earlier studies on checkpointing methods, which are effective for preventive...
An optimal scope patterns decision method for OSI management operations
An optimal scope patterns decision method for OSI management operations
1993,
Presently, integrated network management systems are being developed based on the open...
Recursive Least Squares adaptive algorithm Maximum Likelihood Sequence Estimation: RLS-MLSE
Recursive Least Squares adaptive algorithm Maximum Likelihood Sequence Estimation: RLS-MLSE
1993,
This paper derives the Recursive Least Squares adaptive algorithm ‘Maximum...
Zero-one quadratic programming algorithm for resources leveling of manufacturing process schedules
Zero-one quadratic programming algorithm for resources leveling of manufacturing process schedules
1994,
It is necessary in industrial plant construction scheduling to minimize fluctuation or...
A study of capacity expansion problems based on fuzzy dynamic programming
A study of capacity expansion problems based on fuzzy dynamic programming
1995,
This paper discusses capacity expansion problems for telecommunication network...
An information theoretical approach to optimal problems and its application
An information theoretical approach to optimal problems and its application
1992,
There have been many trials to study optimal problems. Here the authors introduce a...
Optimizing the worst achievement rate in linear programming problems with an interval objective function
Optimizing the worst achievement rate in linear programming problems with an interval objective function
1993,
In this paper, a new solution concept for linear programming problem with an interval...
A successive quadratic programming decomposition method for large-scale nonlinear programming problems
A successive quadratic programming decomposition method for large-scale nonlinear programming problems
1991,
Large-scale nonlinear programming problems usually contain a relatively small number...
A randomized algorithm for finding a near-maximum clique and its experimental evaluations
A randomized algorithm for finding a near-maximum clique and its experimental evaluations
1993,
The so-called Maximum Clique Problem is one of the most famous NP-complete problems...
Advanced dimensioning tool for circuit-switched networks
Advanced dimensioning tool for circuit-switched networks
1992,
The paper has developed an advanced tool for dimensioning circuit-switched networks,...
Papers per page: