Results 1 - 10 of 359

Synthesizing shortest linear straight-line programs over GF(2) using SAT

by Carsten Fuhs, Peter Schneider-kamp - In Proc. SAT ’10, volume 6175 of LNCS , 2010
"... Abstract. Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shortest linear straight-line program for a given set of linear forms is known to be MaxSNP-complete, i.e., there i ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
Abstract. Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shortest linear straight-line program for a given set of linear forms is known to be MaxSNP-complete, i

Optimization of Straight–Line Code Revisited

by Optimization Of Straight-Line, Thomas Noll, Stefan Rieger, Thomas Noll, Stefan Rieger , 2005
"... In this report we study the e#ect of an optimizing algorithm for straight--line code which first constructs a directed acyclic graph representing the given program and then generates code from it. We show that this algorithm produces optimal code with respect to the classical transformations such as ..."
Abstract - Add to MetaCart
In this report we study the e#ect of an optimizing algorithm for straight--line code which first constructs a directed acyclic graph representing the given program and then generates code from it. We show that this algorithm produces optimal code with respect to the classical transformations

Optimization of Straight–Line Code Revisited

by Thomas Noll, Stefan Rieger
"... We study the effect of an optimizing algorithm for straight–line code which first constructs a directed acyclic graph representing the given program and then generates code from it. We show that this algorithm produces optimal code with respect to the classical transformations known as Constant Fold ..."
Abstract - Add to MetaCart
We study the effect of an optimizing algorithm for straight–line code which first constructs a directed acyclic graph representing the given program and then generates code from it. We show that this algorithm produces optimal code with respect to the classical transformations known as Constant

Minimizing the Area for Planar Straight-Line Grid Drawings

by Marcus Krug , 2007
"... The problem of finding straight-line drawings for planar graphs with small area is an important aspect in the context of drawing planar graphs and it has been extensively studied. In this thesis we will study the problem of finding planar straight-line grid drawings with minimum area. Our contribut ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
contributions to this problem are as follows: First, we will show, that the problem of finding minimum area straight-line drawings is N P-complete. Then we will establish a non-trivial lower bound on the area of any grid supporting straight-line drawings of every tree with a given number of nodes. In order

Aliased Register Allocation for Straight-line Programs is NP-Complete

by Jonathan K. Lee, Jens Palsberg, Fernando Magno Quintão Pereira
"... Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of registers is homogeneous. In this paper we study registers which may alias: an aliased register can be used both independentl ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of registers is homogeneous. In this paper we study registers which may alias: an aliased register can be used both

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract)

by Stefan Felsner, Giuseppe Liotta, Stephen Wismath , 2002
"... This paper investigates the following question: Given an integer grid phi, where phi is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of phi? We characterize the trees ..."
Abstract - Cited by 49 (6 self) - Add to MetaCart
crossing-free straight line 3d drawings in linear volume for a non-trivial family of planar graphs. We also show that there exist planar graphs that cannot be drawn on the prism and that extension to a n × 2 × 2 integer grid, called a box, does not admit the entire class of planar

1. Straight Line Programs: Basic Concepts and Properties

by Straight Line Programs, José L. Montaña, Cruz E. Borges, César L. Alonso, José L. Crespo, Definition (slp
"... We discuss here empirical comparison between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we have identif ..."
Abstract - Add to MetaCart
We discuss here empirical comparison between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we have

Adaptation, performance and vapnik-chervonenkis dimension of straight line programs

by José L. Montaña, Cruz E. Borges, César L. Alonso, José L. Crespo - In EuroGP , 2009
"... Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we h ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we

ON PROJECTED NEWTON BARRIER METHODS FOR LINEAR PROGRAMMING AND AN EQUIVALENCE TO KARMARKAR'S PROJECTIVE METHOD

by Philip E. Gill, Walter Murray, Michael A. Saunders, J. A. Tomlin, Margaret H. Wright , 1986
"... Interest in linear programming has been intensified recently by Karmarkar's publication in 1984 of an algorithm that is claimed to be much faster than the simplex method for practical problems. We review classical barrier-function methods for nonlinear programming based on applying a logarithmi ..."
Abstract - Cited by 87 (7 self) - Add to MetaCart
. We then present details of a specific barrier algorithm and its practical implementation. Numerical results are given for several non-trivial test problems, and the implications for future developments in linear programming are discussed.

SYMMETRIES IN LINEAR AND INTEGER PROGRAMS

by Katrin Herr, Richard Bödi , 2009
"... The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show that for any linear program there exists an optimal solution in the fixed point set of its symmetry group. Using this re ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
this result, we develop an algorithm that allows for reducing the dimension of any linear program having a non-trivial group of symmetries.
Results 1 - 10 of 359