Country: Japan

Found 1012 papers in total
The DEA method for Japanese management: The evaluation of local governmental investments to the Japanese economy
The DEA method for Japanese management: The evaluation of local governmental investments to the Japanese economy
1995,
The purpose of this paper is to develop a new DEA method by using ‘consensus...
Group DEA for building consensus by DMU efficiency evaluation
Group DEA for building consensus by DMU efficiency evaluation
1996,
This paper proposes a new method for building group consensus, focusing on evaluating...
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)...
Application of the graph coloring algorithm to the frequency assignment problem
Application of the graph coloring algorithm to the frequency assignment problem
1996,
the frequency assignment problem is introduced and solved with efficient heuristics....
Estimation of the conjugation of Japanese verbs and adjectives with a textural analysis
Estimation of the conjugation of Japanese verbs and adjectives with a textural analysis
1996,
Japanese documents are usually analyzed with the grammatical analysis like the...
Graphical/statistical approach to repair limit replacement problem
Graphical/statistical approach to repair limit replacement problem
1996,
The total time on test (TTT) concept has proved to be a very useful tool in many...
Combinatorial approaches for hard problems in manpower scheduling
Combinatorial approaches for hard problems in manpower scheduling
1996,
Manpower scheduling is concerned with the construction of a workers’ schedule...
2-terminal nets ‘via minimization’ through dynamic-programming for partitioning of terminals
2-terminal nets ‘via minimization’ through dynamic-programming for partitioning of terminals
1994,
In the routing in VLSI and printed circuit board (PCB) using the multilayered board, a...
‘Topological via minimization’ problem for permutation layout when no wire passes between pins
‘Topological via minimization’ problem for permutation layout when no wire passes between pins
1994,
This paper considers the topological via minimization problem in the permutation...
An efficient parallel parsing algorithm for context-free languages based on Earley's method
An efficient parallel parsing algorithm for context-free languages based on Earley's method
1996,
The authors propose a parallel parsing algorithm based on Earley's method, which works...
Complexity and algorithm for Reallocation Problem
Complexity and algorithm for Reallocation Problem
1996,
The authors define the Reallocation Problem to determine whether we can move products...
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...
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...
Application of parallel genetic algorithms to generation expansion planning using parallel processors
Application of parallel genetic algorithms to generation expansion planning using parallel processors
1995,
This paper presents an application of parallel genetic algorithms to optimal...
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...
Stochastic decision-making in a fuzzy environment
Stochastic decision-making in a fuzzy environment
1995,
In this paper the authors consider multistage decision processes in Bellman and...
Papers per page: