Results 1  10
of
359
Synthesizing shortest linear straightline programs over GF(2) using SAT
 In Proc. SAT ’10, volume 6175 of LNCS
, 2010
"... Abstract. Nontrivial linear straightline programs over the Galois field of two elements occur frequently in applications such as encryption or highperformance computing. Finding the shortest linear straightline program for a given set of linear forms is known to be MaxSNPcomplete, i.e., there i ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. Nontrivial linear straightline programs over the Galois field of two elements occur frequently in applications such as encryption or highperformance computing. Finding the shortest linear straightline program for a given set of linear forms is known to be MaxSNPcomplete, i
Optimization of Straight–Line Code Revisited
, 2005
"... In this report we study the e#ect of an optimizing algorithm for straightline 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 straightline 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
"... 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 StraightLine Grid Drawings
, 2007
"... The problem of finding straightline 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 straightline 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 straightline drawings is N Pcomplete. Then we will establish a nontrivial lower bound on the area of any grid supporting straightline drawings of every tree with a given number of nodes. In order
Aliased Register Allocation for Straightline Programs is NPComplete
"... Register allocation is NPcomplete in general but can be solved in linear time for straightline 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 NPcomplete in general but can be solved in linear time for straightline 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
StraightLine Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract)
, 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 straightline crossingfree drawings with vertices located at the grid points of phi? We characterize the trees ..."
Abstract

Cited by 49 (6 self)
 Add to MetaCart
crossingfree straight line 3d drawings in linear volume for a nontrivial 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
"... 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 vapnikchervonenkis dimension of straight line programs
 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
, 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 barrierfunction 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 nontrivial test problems, and the implications for future developments in linear programming are discussed.
SYMMETRIES IN LINEAR AND INTEGER PROGRAMS
, 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 nontrivial group of symmetries.
Results 1  10
of
359