Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Transactions of the Institute of Electronics, Information and Communication Engineers
Found
134 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Global optimization of a function of several variables using the ℝ-approximation approach
1992,
Shimizu Kiyotaka
An •- approximation approach based on tunneling method is proposed for finding a...
A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction
1992,
Sugihara Kokichi
This paper presents a simple method for avoiding both numerical errors and degeneracy...
Route optimization using the FDL path in hybrid switching networks
1991,
Chul Park Young
In this paper, the authors study an algorithm of route optimization using the...
Lexicographical solutions using the excess of player for n-person cooperative games
1992,
Sakawa Masatoshi
An excess of coalition does not include a strength or contribution of a coalition in a...
A method for determining an optimal auto-save time for a word processor
1991,
Sandoh Hiroaki
The present study proposes a method for determining an optimal auto-save time for a...
A note on optimum release problem based on software reliability assessment methods during operation phase
1992,
Osaki Shunji
This paper discusses optimal software release problems of determining the time to...
A neural resolution theory for optimization problems with constraints
1992,
Takahashi Yoshikane
This paper develops a new resolution theory for optimization problems by use of neural...
On the synthesis of flow networks minimizing the sum of edge capacities
1992,
Kishimoto Wataru
A flow network is a graph with a positive capacity for each edge. It can be used as a...
Optimal schemes for disseminating information and their fault tolerance
1992,
Igarashi Yoshihide
The authors describe two information disseminating schemes, t-disseminate and t-R...
Algorithms for detecting separability of nonlinear mappings using computational graphs
1991,
Yamamura Kiyotaka
A nonlinear mapping is called separable if it contains some of the variables in the...
A method for solving the travelling salesman problem by the two-state neural network model
1991,
Oohori Takahumi
Hopfield has shown that the travelling salesman problem (TSP) can be solved on a...
Support model for managing outside orders in software development
1992,
Ohtera Hiroshi
A large scale software is divided into some modules and is developed by some outside...
Parallel algorithms for the maximal tree cover problems
1992,
Chen Zhi-Zhong
A maximal l- diameter tree cover of a graph G=(V,E) is a spanning subgraph C=(V,E C )...
A linear-time algorithm for computing all 3-edge-connected components of a multigraph
1992,
Taoka Satoshi
The subject of the paper is to propose a simple O(ℝ Vℝ+ℝEℝ)...
RS-vector algorithms for combinatorial problems
1992,
Iwama Kazuo
The RS-vector machine is a vector machine based on the vector operations called repeat...
A method for two-dimensional layout of the Semantic Structure graph
1992,
Matsui Tatsunori
In order to analyze human behavior, it is effective to use multiple-choice...
Semantic Structure Analysis on qualitative words for rating scale
1992,
Matsui Tatsunori
The purpose of this paper is to present quantitative evaluation methodology for...
M/G/1 system with set-up time for server replacement
1991,
Nishigaya Takashi
The authors propose an M/G/1 queueing model in which the server is replaced by another...
A modification of the greedy procedure for solving a nonlinear knapsack class of reliability optimization problems
1991,
Nakagawa Yuji
A number of heuristic methods that belong to the greedy procedure have been applied to...
A sub-logarithmic time sorting algorithm on a reconfigurable array
1991,
Masuzawa Toshimitsu
A bus system whose configuration can be dynamically changed is called a reconfigurable...
A note on dual trail partition of a plane graph
1991,
Ueno Shuichi
Given a plane graph G , a trail of G is said to be dual if it is also a trail in the...
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex- and edge-weights on the exterior window
1991,
Kashiwabara Toshinobu
Let G=(V,E) be a biconnected planar graph whose vertices and edges have weights. This...
An algorithm for testing the planarity of a hierarchical graph
1991,
Kashiwabara Toshinobu
Suppose a graph G=(V,E ) is given and a partition of V into K subsets V 1 ,V 2 ,...,V...
Network reliability analysis using dual graph
1991,
Hayashi Masahiro
Overall reliability is a very important measure in net-work reliability analysis....
First Page
1
2
3
4
5
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers