Results 241 to 250 of about 1,150,244 (290)
Some of the next articles are maybe not open access.
Operations Research, 2001
In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x0 be a given feasible solution. The solution x0 may or may not be an optimal solution of P with respect to the cost vector c.
Ahuja, Ravindra K., 1956- +1 more
openaire +3 more sources
In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x0 be a given feasible solution. The solution x0 may or may not be an optimal solution of P with respect to the cost vector c.
Ahuja, Ravindra K., 1956- +1 more
openaire +3 more sources
The Computer Journal, 2004
Summary: The Burrows-Wheeler Compression (BWC) described by Burrows and Wheeler has received considerable attention. An essential part of BWC schemes is the Move-to-Front coder (recency ranking). In this paper we introduce a different coding (ranking) scheme, the inversion coder.
openaire +2 more sources
Summary: The Burrows-Wheeler Compression (BWC) described by Burrows and Wheeler has received considerable attention. An essential part of BWC schemes is the Move-to-Front coder (recency ranking). In this paper we introduce a different coding (ranking) scheme, the inversion coder.
openaire +2 more sources
Inversion of matrices with prescribed structured inverses
IEEE International Conference on Acoustics Speech and Signal Processing, 2002We present here a technique for the inversion of a matrix to an inverse with a prescribed structure. The approach is to generate a set of linear constraints that can then be optimized based on the resulting convex polytope. The approach is general and different error criteria can be implemented with minor modifications.
openaire +1 more source
Inverse kinematic problem: Solutions by pseudoinversion, inversion and no-inversion
Behavioral and Brain Sciences, 1995AbstractKinematic properties of reaching movements reflect constraints imposed on the joint angles. Contemporary models present solutions to the redundancy problem by a pseudoinverse procedure (Whitney 1969) or without any inversion (Berkenblit et al. 1986). Feldman & Levin suggest a procedure based on a regular inversion.
openaire +1 more source
Inverse Order Rule for Weighted Generalized Inverse
SIAM Journal on Matrix Analysis and Applications, 1998The paper establishes some necessary and sufficient conditions for the inverse order rule of the weighted generalized inverse.
Wenyu Sun, Yimin Wei 0001
openaire +1 more source
Combinatorica, 1985
Let \(G\) be a bipartite graph with non-singular adjacency matrix \(A\). For applications in Chemistry the least positive eigenvalue of \(A\) is of interest. The author proves a conjecture by I. Gutman that amongst all trees on \(2m\) vertices having perfect matchings, the path has smallest least positive eigenvalue.
openaire +2 more sources
Let \(G\) be a bipartite graph with non-singular adjacency matrix \(A\). For applications in Chemistry the least positive eigenvalue of \(A\) is of interest. The author proves a conjecture by I. Gutman that amongst all trees on \(2m\) vertices having perfect matchings, the path has smallest least positive eigenvalue.
openaire +2 more sources
Astrophysics and Space Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source