Sciweavers

6120 search results - page 395 / 1224
» The Power of Linear Functions
Sort
View
LSSC
2005
Springer
16 years 9 days ago
On Weighted Structured Total Least Squares
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
Ivan Markovsky, Sabine Van Huffel
COR
2006
86views more  COR 2006»
15 years 6 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
15 years 6 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
Arvind Ayyer, Doron Zeilberger
MCSS
2008
Springer
15 years 6 months ago
Weakly coprime factorization and state-feedback stabilization of discrete-time systems
Abstract: The LQ-optimal state feedback of a finite-dimensional linear time-invariant system determines a coprime factorization NM-1 of the transfer function. We show that the same...
Kalle M. Mikkola
APAL
2000
61views more  APAL 2000»
15 years 6 months ago
Higher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc...