Results 1 - 10 of 25,708

Adaptive Constraint Satisfaction

by J. E. Borrett, E. P. K. Tsang, N. R. Walsh - WORKSHOP OF THE UK PLANNING AND SCHEDULING , 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract - Cited by 952 (43 self) - Add to MetaCart
for solving all problems. At the same time, a consensus appears to have developed to the effect that it is unlikely that any single algorithm is always the best choice for all classes of problem. In this paper we argue that an adaptive approach should play an important part in constraint satisfaction

Algorithms for Constraint-Satisfaction Problems: A Survey

by Vipin Kumar , 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments

Partial Constraint Satisfaction

by Eugene C. Freuder, Richard J. Wallace , 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
. 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

The Semantics Of Constraint Logic Programs

by Joxan Jaffar, Michael Maher, Kim Marriott, Peter Stuckey - JOURNAL OF LOGIC PROGRAMMING , 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained 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

Constrained model predictive control: Stability and optimality

by D. Q. Mayne, J. B. Rawlings, C. V. Rao, P. O. M. Scokaert - AUTOMATICA , 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon open-loop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract - Cited by 738 (16 self) - Add to MetaCart
and the first control in this sequence is applied to the plant. An important advantage of this type of control is its ability to cope with hard constraints on controls and states. It has, therefore, been widely applied in petro-chemical and related industries where satisfaction of constraints is particularly

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

by Steven Minton, Mark D. Johnston, Andrew B. Philips, Philip Laird - ARTIF. INTELL , 1992
"... This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-orderin ..."
Abstract - Cited by 457 (6 self) - Add to MetaCart
This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value

Analogical Mapping by Constraint Satisfaction

by Keith J. Holyoak, Paul Thagard - COGNITIVE SCIENCE 13, 29-5 (1989) , 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract - Cited by 397 (29 self) - Add to MetaCart
the anology Is being used. The theory is implemented in a computer progrom called ACME (Analogical Constraint Mapping Engine), which represents constraints by means of a network of supporting and competing hypotheses regarding what elements to map. A coop erative algorithm for parallel constraint satisfaction

Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”

by Benjamin Recht , Maryam Fazel , Pablo A Parrilo - SIAM Review, , 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract - Cited by 562 (20 self) - Add to MetaCart
for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds

Hybrid Algorithms for the Constraint Satisfaction Problem

by Patrick Prosser - Computational Intelligence , 1993
"... problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflict-directed backjumping ..."
Abstract - Cited by 380 (8 self) - Add to MetaCart
problem (csp), namely, naive backtracking (BT), backjumping (BJ), conflict-directed backjumping

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

by Ros Tassiulas, Anthony Ephremides - IEEE Transactions on Automatic Control , 1992
"... Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract - Cited by 949 (19 self) - Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system
Results 1 - 10 of 25,708