Sciweavers

2636 search results - page 85 / 528
» Linear Programming
Sort
View
MP
2002
85views more  MP 2002»
14 years 9 months ago
Generalized Goal Programming: polynomial methods and applications
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
Emilio Carrizosa, Jörg Fliege
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 4 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
CORR
2007
Springer
109views Education» more  CORR 2007»
14 years 10 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
DAGSTUHL
1996
14 years 11 months ago
Practical Aspects of Specialization of Algol-like Programs
Abstract. A \linearized" scheme of polyvariant specialization for imperative languages is described in the paper. The scheme is intended for increasing e ciency of specializat...
Mikhail A. Bulyonkov, Dmitry V. Kochetov
COLOGNETWENTE
2009
14 years 11 months ago
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen