Results 231 to 240 of about 792,171 (262)

Minimization of drive tests solution in 3GPP

IEEE Communications Magazine, 2012
Providing network coverage and quality of service (QoS) is an important task of a cellular network operator. This is because cellular spectrum is normally licensed under certain coverage obligations, and operators need to be competitive in market. To improve their networks, operators often send engineers in the field to collect radio measurements, to ...
Wuri A. Hapsari, Anil Umesh, Mikio Iwamura, Magorzata Tomala, Gyula Bodog, Benoist Sebire   +5 more
openaire   +1 more source

A unified minimal solution in set optimization

Journal of Global Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khushboo, C. S. Lalitha
openaire   +2 more sources

Minimization of solution functions for a parametric minimization problem

Cybernetics, 1977
In the majori ty of cases of practical application of one or another model of scheduling theory, t h e r e is no need to use laborious methods for constructing optimal solutions. As a rule, practical problems have large dimensions, which, taking into account the asymptotic behavior, allows them to be solved by simple methods of constructing an ...
openaire   +1 more source

The minimal solution of a problem in generalized nets

2012 6th IEEE INTERNATIONAL CONFERENCE INTELLIGENT SYSTEMS, 2012
This paper offers a new approach to a problem in the theory of generalized nets, related to the representability of an arbitrary transition by a composition of set of transitions with fixed two input and two output places. It is proved that the proposed solution is minimal in terms of the numbers of transitions and places.
openaire   +1 more source

A minimization method for the solution of large symmetriric eigenproblems

International Journal of Computer Mathematics, 1998
This paper concerns with the solution of a special eigenvalue problem for a large sparse symmetric matrix by a fast convergent minimization method. A theoretical analysis of the method is developed; it is proved that is convergent with a convergence rate of fourth order.
GALLIGANI, Emanuele, V. RUGGIERO, ZANNI, Luca   +2 more
openaire   +1 more source

Minimal degree solutions of polynomial equations

Kybernetika, 1987
Consider the general Bézout equation of the form \(A_ 1X_ 1+...+A_ rX_ r=C\) where C and the \(A_ i\) are from a polynomial ring R, and we are looking for a solution for the unknowns \(X_ i\) in the same ring. The case where R is the ring of polynomials in two variables over the real or complex field and \(C=1\) arises in multidimensional systems and ...
GENTILI, GRAZIANO, D. STRUPPA
openaire   +3 more sources

Computing Minimal Solutions to the Ring Loading Problem

Information Processing Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Finding Exact Solutions to the Bandwidth Minimization Problem

Computing, 1999
Given an \(m\times m\) sparse symmetric matrix, the authors consider the problem of finding the permutation of rows and columns which minimizes the bandwidth. The problem is known to be NP-complete; therefore no polynomial algorithm in \(m\) is likely to exist. They present two algorithms which exhaustively enumerate all permutations, trying to discard
DEL CORSO, GIANNA MARIA, G. MANZINI
openaire   +3 more sources

MINIMAL SOLUTIONS FOR A CLASS OF ELLIPTIC SYSTEMS

Bulletin of the London Mathematical Society, 2005
Summary: There exists a set \(U\) in the plane, such that elements of \(U\) correspond to minimal stable solutions of a two-parameter elliptic system \(-\Delta u=\mu f(x,u,v)\) in \(D\), \(-\Delta v=\nu g(x,u,v)\) in \(D\), \(u=v=0\) on \(\partial D\).
openaire   +1 more source

Minimal degree solutions for the Bezout equation

Kybernetika, 1987
Consider the Bezout equation \[ (*)\quad A_ 1X_ 1+...+A_ rX_ r=C \] where \(A_ i\), C are given polynomials in \({\mathbb{C}}[x_ 1,...,x_ n]\) and \(X_ i\) are unknown ones. The following two results are proved: Theorem 1. Suppose for each subset \((i_ 1,...,i_ k)\) of (1,...,r) the degree forms of \(A_{i_ 1},...,A_{i_ k}\) form a regular sequence. If (
Ballico, E., Struppa, Daniele C.
openaire   +2 more sources