Results 131 to 140 of about 454,550 (157)
Some of the next articles are maybe not open access.

Genetic Scheduling on Minimal Processing Elements in the Grid

2002
This paper addresses the problem of scheduling parallel program tasks onto computational grid to minimize the execution time of the parallel program and the number of required processing elements. This task scheduling problem is known to be NP-complete.
Wensheng Yao, Baiyan Li, Jinyuan You
openaire   +1 more source

Vector Equilibrium Problems, Minimal Element Problems and Least Element Problems

Positivity, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fang, Ya-Ping, Huang, Nan-Jing
openaire   +2 more sources

Anti-integral elements and coefficients of their minimal polynomials

Mathematical Journal of Okayama University, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oda, Susumu, Yoshida, Ken-ichi
openaire   +3 more sources

Pseudo-minimal transducers: A transducer with proper elements

1998
The algorithm that we present here is an adaptation of the automata pseudo- minimization algorithm for finite-state transducer. After giving some definitions, we give an algorithm to build a pseudominimal transducer, that has an interesting property: each recognized word has a proper element.
Denis Maurel, Laurent Chauvier
openaire   +1 more source

A Unilaterally Constrained Quadratic Minimization with Adaptive Finite Elements

SIAM Journal on Optimization, 2007
We consider obstacle problems where a quadratic functional associated with the Laplacian is minimized in the set of functions above a possibly discontinuous and thin but piecewise affine obstacle. In order to approximate minimum point and value, we propose an adaptive algorithm that relies on minima with respect to admissible linear finite element ...
K. G. Siebert, A. Veeser
openaire   +2 more sources

Minimal Length Elements of Thompson's Group F

Geometriae Dedicata, 2003
This paper faces an important issue about finite presentations of Thompson's group \(F\): the problem of determining the length and the form of the minimal elements of \(F\). In particular, the author focuses on the two generator presentation \[ \langle a, b : [a b^{-1}, a^{-1} b a],\;[a b^{-1}, a^{-2} b a^2] \rangle.
openaire   +2 more sources

An Adaptive Finite Element Method for Minimal Surfaces

2003
Our aimis to compute surfaces of the topological type of the disc that are stationary points of the area functional. Since such computations may be very time consuming, we derive an a posteriori controlled adaptive algorithm based on a recently developed and analyzed finite element method [11] [12] [13]. Numerical results are presented for two examples.
Dörfler, W., Siebert, K. G.
openaire   +1 more source

Planar Posets, Dimension, Breadth and the Number of Minimal Elements

Order, 2015
An ordered set is called planar iff its diagram can be drawn in the plane without any edges crossing. The authors prove that a planar ordered set with \(t\) minimal elements has dimension \(\leq 2t+1\). They also show that, for every \(t\geq 3\), there is a planar ordered set with \(t\) minimal elements and dimension \(\geq t+3\).
William T. Trotter, Ruidong Wang
openaire   +2 more sources

Characterizing Relatively Minimal Elements via Linear Scalarization

2014
In this note we investigate some properties of the relatively minimal elements of a set with respect to a convex cone that has a nonempty quasi-relative interior, in particular their characterization via linear scalarization.
Sorin-Mihai Grad, Emilia-Loredana Pop
openaire   +1 more source

Minimal elements related to a conditional expectation in a C*-algebra

Annals of Functional Analysis, 2023
Jiang Lining
exaly  

Home - About - Disclaimer - Privacy