Results 1  10
of
25,947
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 869 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Partial Constraint Satisfaction
, 1992
"... . A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying ..."
Abstract

Cited by 471 (21 self)
 Add to MetaCart
satisfaction problems illuminates the relative and absolute effectiveness of these methods. A general model of partial constraint satisfaction is proposed. 1 Introduction Constraint satisfaction involves finding values for problem variables subject to constraints on acceptable combinations of values
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method
Relational Constraints in Coalition Formationl
, 1989
"... Citation for published version (APA): Gilles, R. P., & Ruys, P. H. M. (1989). Relational constraints in coalition formation. (Research memorandum / ..."
Abstract
 Add to MetaCart
Citation for published version (APA): Gilles, R. P., & Ruys, P. H. M. (1989). Relational constraints in coalition formation. (Research memorandum /
Clustering with Relative Constraints
"... Recent studies [26, 22] have suggested using relative distance comparisons as constraints to represent domain knowledge. A natural extension to relative comparisons is the combination of two comparisons defined on the same set of three instances. Constraints in this form, termed Relative Constraints ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Recent studies [26, 22] have suggested using relative distance comparisons as constraints to represent domain knowledge. A natural extension to relative comparisons is the combination of two comparisons defined on the same set of three instances. Constraints in this form, termed Relative
Constraint propagation algorithms for temporal reasoning
 Readings in Qualitative Reasoning about Physical Systems
, 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and pointbased temporal representations. Computing the consequences of t ..."
Abstract

Cited by 428 (5 self)
 Add to MetaCart
the original primarily in correcting claims made there about the point algebra, and in presenting some closely related results of van Beek [1989]. The representation of time has been a recurring concern of Artificial Intelligence researchers. Many representation schemes have been proposed for temporal
SameRelation Constraints
"... Abstract. The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the notequal constraint, for every pair of variables. By looking at the set of all pairwise notequal relations at the same time, AllDifferent offers greater ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the notequal constraint, for every pair of variables. By looking at the set of all pairwise notequal relations at the same time, AllDifferent offers greater
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
the gradientprojection method. This amounts to solving a time dependent partial differential equation on a manifold determined by the constraints. As t ~ 0o the solution converges to a steady state which is the denoised image. The numerical algorithm is simple and relatively fast. The results appear
Relative Constraints as Features
"... Abstract. One of most commonly used methods of data mining is clustering. Its goal is to identify unknown yet interesting and useful patters in datasets. Clustering is considered as unsupervised, however recent years have shown a tendency toward incorporation external knowledge into clustering meth ..."
Abstract
 Add to MetaCart
usually leads to better performance and accuracy of clustering results. In spite of growing interest in constraint based clustering this domain still needs attention. For example, a promising relative constraints have not been widely investigated and seem to be very promising since they can be easily
Performance pay and topmanagement incentivesâ€™â€™,
 Journal of Political Economy,
, 1990
"... Abstract Our estimates of the payperformance relation (including pay, options, stockholdings, and dismissal) for chief executive officers indicate CEO wealth changes $3.25 for every $1,000 change in shareholder wealth. Although the incentives generated by stock ownership are large relative to pay ..."
Abstract

Cited by 1137 (19 self)
 Add to MetaCart
and dismissal incentives, most CEOs hold trivial fractions of their firm's stock and ownership levels have declined over the past 50 years. We hypothesize that public and private political forces impose constraints that reduce the payperformance sensitivity. Declines in both the payperformance relation
Results 1  10
of
25,947