Results 211 to 220 of about 70,896 (263)

OptOrch: a modular optimization toolkit for forest tree seed orchard deployment. [PDF]

G3 (Bethesda)
Kim YJ, Bittner V, Kang KS, Sagariya C, Lstibůrek M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fault Tolerant Subcube Allocation in Hypercubes

1993 International Conference on Parallel Processing - ICPP'93 Vol1, 1993
The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subcubes is then introduced to take advantage of the advanced switching techniques such as wormhole routing to increase the size of available sub cubes.
Yeimkuan Chang, Laxmi N. Bhuyan
openaire   +2 more sources

Fast Fault-Tolerant Resource Allocation

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2011
We present the first efficient approximation algorithm for the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem [13] with uniform fault tolerance levels. UFTRA is a relaxation of the classical Fault-Tolerant Facility Location problem [11].
Kewen Liao, Hong Shen 0001
openaire   +1 more source

Stable and fault-tolerant object allocation

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, 2000
Support for efficient dynamic migration and replication of objects is essential for achieving adequate performance and scalability. Traditional solutions to the problem focused on competitiveness. This means that the algorithm's complexity matches the offline adversary's complexity within an acceptable ratio.
Gregory F. Johnson, Ambuj K. Singh
openaire   +1 more source

Fault tolerant subcube allocation in hypercube

Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 2002
Dimensional communicable 2 subcubes allocation problems in faulty hypercubes are studied in this paper. An n-cube is investigated on whether the faulty n-cube possesses 2 m-dimensional disjoint fault-free subcubes or not. Larger values of m is more efficient in practical uses, so the case of m=n-2 is first examined.
Hiroyuki Hashimoto, Hiroshi Masuyama, Toshihiko Sasama   +2 more
openaire   +2 more sources

Optimal Tolerance Allocation for Tolerance Stack-Ups

19th Design Automation Conference: Volume 2 — Design Optimization; Geometric Modeling and Tolerance Analysis; Mechanism Synthesis and Analysis; Decomposition and Design Optimization, 1993
Abstract The allocation of individual tolerances that form critical stack-ups is an important task in mechanical design. It is desirable, but difficult in practice, to allocate tolerances to obtain all required stack-ups at minimum cost. A minimum-cost allocation method is proposed here that works for both a single tolerance stack-up and
Thomas L. Dresner, Philip Barkan
openaire   +1 more source

Process tolerance allocation in angular tolerance charting

International Journal of Production Research, 2004
The paper deals with the process tolerance allocation problem for manufacturing a product with angular features in two-dimensional angular tolerance charting. First, a discrete interval cost–tolerance model is investigated to represent the relationship between manufacturing cost and tolerance. Then a multichoice knapsack model is formulated to allocate
J. Xue, P. Ji *
openaire   +1 more source