Results 261 to 270 of about 383,425 (312)
Some of the next articles are maybe not open access.
SIAM Journal on Applied Mathematics, 1973
Consider a set of n pins and $n( n - 1 )/2$ specified numbers of wire connections between all pairs of the n pins There are also n holes all in a line with adjacent holes at unit distances apart. The problem is to put the n pins into the n holes such that the total wire length is a minimum.
Adolphson, D., Hu, T. C.
openaire +2 more sources
Consider a set of n pins and $n( n - 1 )/2$ specified numbers of wire connections between all pairs of the n pins There are also n holes all in a line with adjacent holes at unit distances apart. The problem is to put the n pins into the n holes such that the total wire length is a minimum.
Adolphson, D., Hu, T. C.
openaire +2 more sources
Journal of Algorithms, 1990
Summary: We investigate the problem of linear broadcast, which is performed in a network in which messages follow linear routes. This is a characteristic of many high-speed networks, in which a special hardware is used for switching. Following, extending, and improving the recent work of \textit{C. T. Chou} and \textit{I. S.
Bitan, Sara, Zaks, Shmuel
openaire +1 more source
Summary: We investigate the problem of linear broadcast, which is performed in a network in which messages follow linear routes. This is a characteristic of many high-speed networks, in which a special hardware is used for switching. Following, extending, and improving the recent work of \textit{C. T. Chou} and \textit{I. S.
Bitan, Sara, Zaks, Shmuel
openaire +1 more source
Journal of Algorithms, 1993
Summary: Let \(\Gamma_ 0\) be a set of \(n\) halfspaces in \(E^ d\) (where the dimension \(d\) is fixed) and let \(m\) be a parameter, \(n\leq m\leq n^{\lfloor d/2\rfloor}\). We show that \(\Gamma_ 0\) can be preprocessed in time and space \(0(m^{1+\delta}\)) (for any fixed \(\delta>0\)) so that given a vector \(c\in E^ d\) and another set \(\Gamma_ q\)
openaire +1 more source
Summary: Let \(\Gamma_ 0\) be a set of \(n\) halfspaces in \(E^ d\) (where the dimension \(d\) is fixed) and let \(m\) be a parameter, \(n\leq m\leq n^{\lfloor d/2\rfloor}\). We show that \(\Gamma_ 0\) can be preprocessed in time and space \(0(m^{1+\delta}\)) (for any fixed \(\delta>0\)) so that given a vector \(c\in E^ d\) and another set \(\Gamma_ q\)
openaire +1 more source
Order‐constrained linear optimization
British Journal of Mathematical and Statistical Psychology, 2017Despite the fact that data and theories in the social, behavioural, and health sciences are often represented on an ordinal scale, there has been relatively little emphasis on modelling ordinal properties. The most common analytic framework used in psychological science is the general linear model, whose variants include ANOVA ...
Joe W, Tidwell +3 more
openaire +2 more sources
Abstract Optimal Linear Filtering
SIAM Journal on Control and Optimization, 2000The linear optimal filtering problems in infinite-dimensional Hilbert spaces and their extensions are investigated. The quality functional is allowed to be a general quadratic functional defined by a possibly degenerate operator. The solutions of the stable and the causal filtering problems are obtained.
Fomin, Vladimir N. +1 more
openaire +2 more sources
Linear Multimodel Time Optimization
Optimal Control Applications and Methods, 2002AbstractA linear optimization problem with unknown parameters from a given finite set is tackled. The problem is to find therobust time‐optimal controltransferring a given initial point to a convex terminal compact setMforallunknown parameters in a shortest time. The robust maximum principle for this minimax problem is formulated.
Boltyanski, V., Poznyak, A.
openaire +1 more source
1994
Abstract Optimization is itself a large area within the field of applied mathematics. It deals with the minimization and maximization of functions with or without constraints and has many different applications. A large number of these applications belong to the area of operations research within the economic sciences.
openaire +1 more source
Abstract Optimization is itself a large area within the field of applied mathematics. It deals with the minimization and maximization of functions with or without constraints and has many different applications. A large number of these applications belong to the area of operations research within the economic sciences.
openaire +1 more source
Optimal Linearization in Holography
Applied Optics, 1969Optimal linearization in holography is studied from the nonlinear system theory point of view. A generalized optimal linearization method for a physical photographic emulsion is presented. A generalized first-order amplitude transmittance (i.e., the generalized transfer function) with respect to the input irradiance is determined.
openaire +2 more sources