Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: Japan
Found
1012 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Remarks on potential versus barrier function methods for linear programming
1991,
Tone Kaoru
Some relations between potential and barrier function methods for linear programming...
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...
On the joint distribution of the departure intervals in an M/G/1/N queue
1991,
Ishikawa Akihiko
This paper discussed a stationary departure process from the M/G/1/N queue. Using a...
On testing the difference of the means of survival functions under competing risks
1991,
Noda Kazuo
The authors discuss a testing problem for the difference in means of survival function...
Theory and algorithms of the Laguerre transform, Part II: Algorithm
1991,
Kijima Masaaki
The Laguerre transform developed by Keilson, Nunn and Sumita provides an algorithmic...
Sequential decision making: Some non-technical applications of dynamic programming
1991,
Norman J.M.
The paper presents an elementary introduction to dynamic programming and describes...
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...
Precise formulation and applicability of a Software Reliability Growth Model based on Hyper-Geometric Distribution
1991,
Jacoby Raymond
In this paper, the Hyper-Geometric Distribution is used to estimate the number of...
On an automated two-machine flowshop scheduling problem with infinite buffer
1991,
Kise Hiroshi
This paper discusses a new flowshop scheduling problem related to automated...
An exactly optimal strategy for a search problem with traveling cost
1991,
Kikuta Kensaku
There are n neighboring cells in a straight line. An object is in one of the cells. It...
Traffic administration for switching system based on daily traffic forecast
1991,
Matsuda Jun
This paper describes a daily traffic forecasting method, which is a key aspect of...
An analysis of statistical multiplexing in an ATM transport network
1991,
Saito Hiroshi
The traffic characteristics of an ATM network are analyzed by theoretical methods. A...
Numerical comparison among structured quasi-Newton methods for nonlinear least squares problems
1991,
Yabe Hiroshi
The purpose of this paper is to construct effective algorithms for solving nonlinear...
Approximations for the waiting time in the GI/G/s queue
1991,
Kimura Toshikazu
The paper provides some two-moment approximation formulas for the mean waiting time...
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...
Brownian motion with a discrete drag coefficient and its analysis in terms of characteristic functionals
1990,
Okasaki Takashi
A functional formalism is presented to determine multi-time statistics of the...
A search game with traveling cost
1991,
Kikuta Kensaku
There are n neighboring cells in a striaght line. A man selects a cell, hides in it...
Numerically robust divide-and-conquer algorithm for constructing Voronoi diagrams
1991,
Ooishi Yasuaki
The paper presents a method to make the divide-and-conquer algorithm for constructing...
Scheduling of flexible manufacturing systems using fuzzy inference-Realization of various scheduling objectives
1991,
Tamura Hiroyuki
In order to realize an intelligent scheduling for flexible manufacturing the authors...
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
1991,
Kataoka Seiji
It is commonly believed that the use of the assignment problem works well when one...
AHP applied to binary and ternary comparisons
1990,
Takahashi Iwaro
This paper confines the values of the components of comparison matrix of AHP, to two (...
Simplicial algorithm for computing a core element in a balanced game
1991,
Kamiya Kazuya
This paper proposes a simplicial algorithm to find a core element for balanced games...
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...
First Page
32
33
34
35
36
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers