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

Found 134 papers in total
Modeling and performance analysis of cellular networks with channel borrowing
Modeling and performance analysis of cellular networks with channel borrowing
2002,
This paper presents the analysis of integrated voice and data cellular networks with...
Another proof of polynomial-time recognizability of Delaunay graphs
Another proof of polynomial-time recognizability of Delaunay graphs
2000,
This paper presents an algorithm to judge whether a given graph is homeomorphic to...
A simple proof of a minimum cut algorithm and its applications
A simple proof of a minimum cut algorithm and its applications
1999,
For the correctness of the minimum cut algorithm proposed by Nagamochi and Ibaraki,...
Complexity of subgraph colorability problems
Complexity of subgraph colorability problems
2000,
We introduce a subgraph colorability problem (SCP) and study the complexity. SCP is a...
A cost optimal parallel algorithm for balanced decomposition trees
A cost optimal parallel algorithm for balanced decomposition trees
2000,
If an edge is removed from a binary tree, the tree is partitioned into two subtrees....
On metaheuristic algorithms for combinatorial optimization problems
On metaheuristic algorithms for combinatorial optimization problems
2000,
Metaheuristic algorithms are widely recognized as one of the most practical approaches...
Symmetries in distributed computing
Symmetries in distributed computing
2000,
A distributed system consists of a set of autonomous agents and a set of communication...
Tuning fuzzy control rules by the alpha constrained method which solves constrained nonlinear optimization problems
Tuning fuzzy control rules by the alpha constrained method which solves constrained nonlinear optimization problems
1999,
Learning of fuzzy control rules can be considered as a constrained nonlinear...
An approximate solution method for general 0–1 programming problems through genetic algorithms with double string representation
An approximate solution method for general 0–1 programming problems through genetic algorithms with double string representation
1999,
In this paper, genetic algorithms using double string representation proposed by M....
Connection oriented packet communication control method based on game theory
Connection oriented packet communication control method based on game theory
1999,
This paper proposes the new distributed control method for the connection oriented...
Performance analysis of End-to-End Go-Back-N ARQ protocols over tandem links
Performance analysis of End-to-End Go-Back-N ARQ protocols over tandem links
1998,
We analyze the performance of two types of Positive-ACK Go-Back-N ARQ protocols (with...
Performance analysis of asynchronous transfer mode traffic control mechanisms for guaranteed throughput service
Performance analysis of asynchronous transfer mode traffic control mechanisms for guaranteed throughput service
1998,
While tagging-based variable-bit-rate (VBR) and guaranteed-frame-rate (GFR) guarantee...
Analysis for performance and reliability of fault tolerant parallel software
Analysis for performance and reliability of fault tolerant parallel software
1998,
The authors have proposed a method converting parallel programs to construct...
A scale-down solution of N2–1 puzzle
A scale-down solution of N2–1 puzzle
1998,
Real-time decision making algorithms like ‘real-time search’ have become...
Shortest path problem with an obstructor
Shortest path problem with an obstructor
1996,
Let G=(V,A) be a directed graph with (positive) length l(a) for each a∈A, and two...
Global optimization method applying chaos in multi-trajectory inertial system
Global optimization method applying chaos in multi-trajectory inertial system
1996,
Multi-trajectory inertial system is a new global optimization method where more than...
Effects of simulated annealing in the resonant-tunneling resistive-fuse network for early vision
Effects of simulated annealing in the resonant-tunneling resistive-fuse network for early vision
1996,
The resistive-fuse network for early vision was studied using circuit simulation to...
Adaptive mean field approximation algorithm with critical temperature for combinatorial optimization problem
Adaptive mean field approximation algorithm with critical temperature for combinatorial optimization problem
1996,
The mean field approximation algorithm has applied by many researchers to solve...
Is a given flow uncontrollable?
Is a given flow uncontrollable?
1996,
An s-t flow in a directed network is called ‘uncontrollable’, when the...
A study on the number of spare sectors in a hard disk
A study on the number of spare sectors in a hard disk
1996,
A hard disk has two failure modes: (1) failures of mechanical components and (2)...
On the complexity of embedding of graphs into grids with minimum congestion
On the complexity of embedding of graphs into grids with minimum congestion
1996,
It is known that the problem of determining, given a planar graph G with maximum...
The maximum-weight-window problem of a planar graph
The maximum-weight-window problem of a planar graph
1995,
An undirected graph is called a planar graph if it can be drawn on a plane without the...
Largest similar substructure problems for trees and their algorithms
Largest similar substructure problems for trees and their algorithms
1995,
This paper discusses the problems of finding similar substructures in tree T b to tree...
Algorithms for computing the distances between unordered trees
Algorithms for computing the distances between unordered trees
1995,
This paper proposes algorithms for computing three kinds of distances between two...
Papers per page: