Found 97029 papers in total
1989,
One approach to the moment-matching problem for phase distributions to restrict selection to an...
1989,
This paper presents an alternative to the beta continuous probability distribution for risk analysis....
1988,
A new computational algorithm is presented for the solution of discrete time linearly constrained...
1989,
The authors consider time-average Markov Decision Processes (MDPs), which accumulate a reward and cost at...
1989,
The authors present three algorithms to solve the infinite horizon, expected discounted total reward...
1989,
Many practical scheduling problems involve processing several batches of related jobs on common facilities...
1989,
In stochastic versions of combinatorial optimization problems, the objective is to maximize or minimize a...
1989,
Asymptotic stability of equilibrium states and convergence properties of some algorithms for computing...
1989,
This paper presents a method to determine the structures of p- valued majority functions and clarifies...
1989,
In recent years, the problem of uncertainty modeling has received much attention from scholars in...
1989,
Choice functions based on t -norms of valued binary relations are introduced. Strict preference is also...
1989,
Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic...
1989,
The paper presents a solution to certain possibilistic linear programming problems.
1989,
In this paper, the authors focus on multiobjective linear fractional programming problems with fuzzy...
1989,
Constrained game formulations are provided for DEA (Data Envelopment Analysis) which extend the original...
1989,
Sequencing situations with linear cost functions are considered. A division rule for the cost savings is...
1989,
The paper provides an axiomatization of the core of market games (totally balanced coalitional games). It...
1989,
Fulkerson characterized the blocking matrix to the incidence matrix of all spanning trees of the graph....
1989,
Let G=(V,E) be a connected undirected graph with positive edge lengths. Let V={0}ℝN, where...
1989,
A set of vertices D is a dominating set for a graph G=(V,E) if every vertex in V-D is adjacent to a vertex...
1989,
A heuristic algorithm for drawing visually understandable hierarchical directed graphs is presented. The...
1989,
It is known that before actually solving the Steiner Problem in graphs, reduction tests can considerably...
1989,
An extension of matchings is considered: instead of edges, odd length chains are used, all of which have...
1989,
The authors study order preserving injections or bipartite matchings from poset V 1 to poset V 2 . When V...
Papers per page: