Results 1  10
of
866,213
nFold integer programming in cubic time
, 2013
"... nFold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variabledimension, parametrization of all of integer programming. The fastest algorithm for nfold integer programming pr ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
nFold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variabledimension, parametrization of all of integer programming. The fastest algorithm for nfold integer programming
Multicommodity flow in Polynomial time
, 2009
"... The multicommodity flow problem is NPhard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of nfold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations ..."
Abstract
 Add to MetaCart
The multicommodity flow problem is NPhard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of nfold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad
The Encyclopedia of Integer Sequences
"... This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae, programs ..."
Abstract

Cited by 866 (15 self)
 Add to MetaCart
This article gives a brief introduction to the OnLine Encyclopedia of Integer Sequences (or OEIS). The OEIS is a database of nearly 90,000 sequences of integers, arranged lexicographically. The entry for a sequence lists the initial terms (50 to 100, if available), a description, formulae
The Omega Test: a fast and practical integer programming algorithm for dependence analysis
 Communications of the ACM
, 1992
"... The Omega testi s ani nteger programmi ng algori thm that can determi ne whether a dependence exi sts between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds thati nteger programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method ..."
Abstract

Cited by 521 (15 self)
 Add to MetaCart
programs, the average ti me requi red by the Omega test to determi ne the di recti on vectors for an array pai ri s less than 500 secs on a 12 MIPS workstati on. The Omega testi based on an extensi n of Four i0Motzki var i ble eli937 ti n (aliB: r programmiA method) toi nteger programmi ng, and has worst
COMBINATORIC NFOLD CATEGORIES AND NFOLD OPERADS
, 2004
"... ABSTRACT. Operads were originally defined as Voperads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the associativity that must be a property of the action of ..."
Abstract
 Add to MetaCart
of an operad on any of its algebras. A sequence of categorical types that filter the category of monoidal categories and monoidal functors is given by Balteanu, Fiedorowicz, Schwänzl and Vogt in [Balteanu et.al, 2003]. These subcategories of MonCat have objects that are called nfold monoidal categories. A k–fold
Literate programming
 THE COMPUTER JOURNAL
, 1984
"... The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones. ..."
Abstract

Cited by 549 (3 self)
 Add to MetaCart
The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones.
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 653 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 989 (3 self)
 Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
Results 1  10
of
866,213