Results 1  10
of
27,737
On the Encoding of Constraint Satisfaction Problems with 0/1 Variables
 CP’01 Workshop on Modelling and Problem Formulation
, 2001
"... Abstract. Many constraint satisfaction problems (csp’s) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently we have constraints that restrict t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Many constraint satisfaction problems (csp’s) are formulated with 0/1 variables. Sometimes this is a natural encoding, sometimes it is as a result of a reformulation of the problem, other times 0/1 variables make up only a part of the problem. Frequently we have constraints that restrict
Reformulations of Rational Functions of 01 Variables
, 2001
"... We present mix5UqC teger linear programming reformulations of rational functions of 01 variables and analyze the tightness of the corresponding linear relax ations. In the process of doing so, we develop a number of new results. First, we consider the product of a single continuous variable and the ..."
Abstract
 Add to MetaCart
We present mix5UqC teger linear programming reformulations of rational functions of 01 variables and analyze the tightness of the corresponding linear relax ations. In the process of doing so, we develop a number of new results. First, we consider the product of a single continuous variable
A Polytope for a Product of Real Linear Functions in 0/1 Variables
, 2003
"... In the context of integer programming, we develop a polyhedral method for linearizing a product of a pair of real linear functions in 0/1 variables. As an example, by writing a pair of integer variables in binary expansion, we have a technique for linearizing their product. We give a complete linea ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In the context of integer programming, we develop a polyhedral method for linearizing a product of a pair of real linear functions in 0/1 variables. As an example, by writing a pair of integer variables in binary expansion, we have a technique for linearizing their product. We give a complete
A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables?
"... 1 Introduction A constraint satisfaction problem (csp) is composed of a set of variables, each with a domain of values. Constraints restrict combinations of variable assignments. The problem is to find an assignment of values to variables that satisfies the constraints, or show that none exists [9]. ..."
Abstract
 Add to MetaCart
1 Introduction A constraint satisfaction problem (csp) is composed of a set of variables, each with a domain of values. Constraints restrict combinations of variable assignments. The problem is to find an assignment of values to variables that satisfies the constraints, or show that none exists [9
August 29, 1995A Heuristic Search For Linear Programs with 01 Variables
, 1995
"... Solving a linear program with 01 constrained variables is an NPcomplete problem. Such linear programs have many practical uses in the area of scheduling. This paper describes a heuristicbased method for finding feasible solutions to such linear programs. We will also provide the motivation for at ..."
Abstract
 Add to MetaCart
Solving a linear program with 01 constrained variables is an NPcomplete problem. Such linear programs have many practical uses in the area of scheduling. This paper describes a heuristicbased method for finding feasible solutions to such linear programs. We will also provide the motivation
Representing twentieth century spacetime climate variability, part 1: development of a 196190 mean monthly terrestrial climatology
 Journal of Climate
, 1999
"... The construction of a 0.58 lat 3 0.58 long surface climatology of global land areas, excluding Antarctica, is described. The climatology represents the period 1961–90 and comprises a suite of nine variables: precipitation, wetday frequency, mean temperature, diurnal temperature range, vapor pressur ..."
Abstract

Cited by 581 (13 self)
 Add to MetaCart
The construction of a 0.58 lat 3 0.58 long surface climatology of global land areas, excluding Antarctica, is described. The climatology represents the period 1961–90 and comprises a suite of nine variables: precipitation, wetday frequency, mean temperature, diurnal temperature range, vapor
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
The Dantzig selector: statistical estimation when p is much larger than n
, 2005
"... In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n ≪ ..."
Abstract

Cited by 879 (14 self)
 Add to MetaCart
≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 474 (7 self)
 Add to MetaCart
This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X
An autoregressive distributed lag modelling approach to cointegration analysis
 Cambridge University
, 1999
"... This paper examines the use of autoregressive distributed lag (ARDL) models for the analysis of longrun relations when the underlying variables are I(1). It shows that after appropriate augmentation of the order of the ARDL model, the OLS estimators of the shortrun parameters are p Tconsistent wi ..."
Abstract

Cited by 393 (6 self)
 Add to MetaCart
This paper examines the use of autoregressive distributed lag (ARDL) models for the analysis of longrun relations when the underlying variables are I(1). It shows that after appropriate augmentation of the order of the ARDL model, the OLS estimators of the shortrun parameters are p T
Results 1  10
of
27,737