Results 1  10
of
16,199
The linear constraints
, 2006
"... We investigate the character of the linear constraints which are needed for Poincaré and Korn type inequalities to hold. We especially analyze constraints which depend on restriction on subsets of positive measure and on the trace on a portion of the boundary. 1 ..."
Abstract
 Add to MetaCart
We investigate the character of the linear constraints which are needed for Poincaré and Korn type inequalities to hold. We especially analyze constraints which depend on restriction on subsets of positive measure and on the trace on a portion of the boundary. 1
Lincs: A linear constraint solver for molecular simulations
 J. Comput. Chem
, 1997
"... .LINCS for molecular simulations with bond constraints. The algorithm is inherently stable, as the constraints themselves are reset instead of derivatives of the constraints, thereby eliminating drift. Although the derivation of the algorithm is presented in terms of matrices, no matrix matrix multi ..."
Abstract

Cited by 303 (1 self)
 Add to MetaCart
.LINCS for molecular simulations with bond constraints. The algorithm is inherently stable, as the constraints themselves are reset instead of derivatives of the constraints, thereby eliminating drift. Although the derivation of the algorithm is presented in terms of matrices, no matrix matrix
Encoding Linear Constraints into SAT
"... Abstract. Linear integer constraints are one of the most important constraints in combinatorial problems since they are commonly found in many practical applications. Typically, encoding linear constraints to SAT performs poorly in problems with these constraints in comparison to constraint programm ..."
Abstract
 Add to MetaCart
Abstract. Linear integer constraints are one of the most important constraints in combinatorial problems since they are commonly found in many practical applications. Typically, encoding linear constraints to SAT performs poorly in problems with these constraints in comparison to constraint
Uncertain Linear Constraints
"... Abstract. Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty formalisms to this situation, as their representation of the underlying logic, either as a mutually exclusive and ..."
Abstract
 Add to MetaCart
Abstract. Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying many AI uncertainty formalisms to this situation, as their representation of the underlying logic, either as a mutually exclusive
Processing Queries By Linear Constraints
 Proceedings of the 1997 ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems (PODS’97
, 1997
"... The emergence of several new application domains for databases has introduced the need for more efficient complex query handling than databases currently support. These application domains include OnLine Analytical Processing (OLAP), Geographical Information Systems (GIS), and scientific databases ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
databases. This paper focuses attention on a form of selection query, expressible in SQL but not evaluated efficiently by current DBMSs, with wide applicability in these new problem domains. We introduce a processing strategy for this class of queries, which we call queries by linear constraints (QBLC
Scheduling under Linear Constraints
"... We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is ..."
Abstract
 Add to MetaCart
We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem
Typing Linear Constraints
"... We present a type system for linear constraints over the reals intended for reasoning about the inputoutput directionality of variables. Types model the properties of definiteness, range width or approximation, lower and upper bounds of variables in a linear constraint. Several proof procedures are ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present a type system for linear constraints over the reals intended for reasoning about the inputoutput directionality of variables. Types model the properties of definiteness, range width or approximation, lower and upper bounds of variables in a linear constraint. Several proof procedures
Variable Ranges in Linear Constraints
"... We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta)reasoning about the approximation width of variables. Semantics for linearrange constraints is provided in terms of parameterized linear systems. We devise procedures for checking satisfiability ..."
Abstract
 Add to MetaCart
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta)reasoning about the approximation width of variables. Semantics for linearrange constraints is provided in terms of parameterized linear systems. We devise procedures for checking satisfiability
Tractable Disjunctions of Linear Constraints
 Theoretical Computer Science
, 1996
"... We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and inequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and ..."
Abstract
 Add to MetaCart
We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and inequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez
Solving Sparse Linear Constraints
"... Abstract. Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dominated by simple difference constraints of the form x ≤ y + c. Sparse linear arithmetic (SLA) denotes a set of ..."
Abstract
 Add to MetaCart
Abstract. Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dominated by simple difference constraints of the form x ≤ y + c. Sparse linear arithmetic (SLA) denotes a set
Results 1  10
of
16,199