Sciweavers

3221 search results - page 48 / 645
» Termination of Linear Programs
Sort
View
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
14 years 1 months ago
Parsing and translation of expressions by genetic programming
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
David Jackson
IPL
2007
78views more  IPL 2007»
13 years 7 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
OL
2011
217views Neural Networks» more  OL 2011»
13 years 2 months ago
Privacy-preserving linear programming
Abstract. We propose a privacy-preserving formulation of a linear program whose constraint matrix is partitioned into groups of columns where each group of columns and its correspo...
O. L. Mangasarian
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 8 months ago
Rewriting modulo in Deduction modulo
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
Frédéric Blanqui
AMC
2005
127views more  AMC 2005»
13 years 7 months ago
The identification of nondominated and efficient paths on a network
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...