Results 1  10
of
760,970
Roundings respecting hard constraints
 In Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science
, 2005
"... Abstract. A problem arising in integer linear programming is to transform a solution of a linear system to an integer one which is “close”. The customary model to investigate such problems is, given a matrix A and a [0, 1] valued vector x, to find a binary vector y such that �A(x − y)�∞ (the violati ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
constraints without violation. The objective of this paper is to investigate such problems in a unified way. To this aim, we extend the notion of linear discrepancy, the theorem of Beck and Fiala and the method of randomized rounding to this setting. Whereas some of our examples show that additional hard
Imposing Hard Constraints on Soft Snakes
, 1996
"... An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snakelike models. We believe this capability to be essential not only for the accurate modeling of individual objects that obey kno ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snakelike models. We believe this capability to be essential not only for the accurate modeling of individual objects that obey
Learning hard constraints in MaxSAT
 In: CSCLP2006. (2006) 1–12
, 2006
"... Abstract. Solving overconstrained problems with MaxSAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has not y ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Solving overconstrained problems with MaxSAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
A Methodology for Managing Hard Constraints in CLP Systems
, 1991
"... In constraint logic programming (CLP) systems, the standard technique for dealing with hard constraints is to delay solving them until additional constraints reduce them to a simpler form. For example, the CLP(R) system delays the solving of nonlinear equations until they become linear, when certain ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
In constraint logic programming (CLP) systems, the standard technique for dealing with hard constraints is to delay solving them until additional constraints reduce them to a simpler form. For example, the CLP(R) system delays the solving of nonlinear equations until they become linear, when
Hard Constraints for Grammatical Function Labelling
"... For languages with (semi) free word order (such as German), labelling grammatical functions on top of phrasestructural constituent analyses is crucial for making them interpretable. Unfortunately, most statistical classifiers consider only local information for function labelling and fail to captu ..."
Abstract
 Add to MetaCart
to capture important restrictions on the distribution of core argument functions such as subject, object etc., namely that there is at most one subject (etc.) per clause. We augment a statistical classifier with an integer linear program imposing hard linguistic constraints on the solution space output
Control of Multivariable Systems with Hard Constraints
 In Proc. of the European Control Conference
, 2001
"... Technical reports from the Automatic Control group in Linköping are available by anonymous ftp at the address ftp.control.isy.liu.se. This report is contained in the file 2348.pdf. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Technical reports from the Automatic Control group in Linköping are available by anonymous ftp at the address ftp.control.isy.liu.se. This report is contained in the file 2348.pdf.
Synthesis of Textural Motion with Hard Constraints
, 2003
"... Obtaining high quality, realistic motions of articulated characters is both timeconsuming and expensive, necessitating the development of easytouse and effective tools for motion editing and reuse. We propose a new simple technique for generating constrained variations of different lengths from a ..."
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Results 1  10
of
760,970