Results 1  10
of
3,102,563
CPlan: A constraint programming approach to planning
 Proc. Sixteenth National Conference on Artificial Intelligence (AAAI99
, 1999
"... Constraint programming, a methodology for solving difficult combinatorial problems by representing them as constraint satisfaction problems, has shown that a general purpose search algorithm based on constraint propagation combined with an emphasis on modeling can solve large, practical scheduling p ..."
Abstract

Cited by 103 (1 self)
 Add to MetaCart
problems. Given the success of constraint programming on scheduling problems and the similarity of scheduling to planning, the question arises, would a constraint programming approach work as well in planning? In this paper, we present evidence that a constraint programming approach to planning does indeed
CPlan: A Constraint Programming Approach to Planning
"... Constraint programming, a methodology for solving difficult combinatorial problems by representing them as constraint satisfaction problems, has shown that a general purpose search algorithm based on constraint propagation combined with an emphasis on modeling can solve large, practical scheduling p ..."
Abstract
 Add to MetaCart
problems. Given the success of constraint programming on scheduling problems and the similarity of scheduling to planning, the question arises, would a constraint programming approach work as well in planning? In this paper, we present evidence that a constraint programming approach to planning does indeed
A Constraint Programming Approach for Workflow Applications
"... This paper proposes a constraint programming approach for workflow applications in which a slip is regarded as a tuple of the RDB model. A workflow is considered to be a series of database updating and constraint maintenance processes in this case. The proposed method utilizes preconditions and pos ..."
Abstract
 Add to MetaCart
This paper proposes a constraint programming approach for workflow applications in which a slip is regarded as a tuple of the RDB model. A workflow is considered to be a series of database updating and constraint maintenance processes in this case. The proposed method utilizes pre
A Constraint Programming Approach to Cutset Problems
 JOURNAL COMPUTERS AND OPERATIONS RESEARCH. VOLUME 33, ISSUE
, 2006
"... We consider the problem of finding a cutset in a directed graph G =(V,E), i.e. a set of vertices that cuts all cycles in G. Finding a cutset of minimum cardinality is NPhard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper we propo ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
propose a constraint programming approach to cutset problems and design a global constraint for computing cutsets. This cutset constraint is a global constraint over boolean variables associated to the vertices of a given graph and states that the subgraph restricted to the vertices having their boolean
A constraint programming approach to instruction assignment
 The 15th Annual Workshop on the Interaction between Compilers and Computer Architecture (INTERACT’15
, 2011
"... A fundamental problem in compiler optimization, which has increased in importance due to the spread of multicore architectures, is to find parallelism in sequential programs. Current processors can only be fully taken advantage of if workload is distributed over the available processors. In this pa ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. In this paper we look at distributing instructions in a block of code over multicluster processors, the instruction assignment problem. The optimal assignment of instructions in blocks of code on multiple processors is known to be NPcomplete. In this paper we present a constraint programming approach
Performance Analysis of Metaheuristic and Constraint Programming Approaches to Generate Structural Test Cases
"... Structural test case generation has been carried out by various approaches in software testing. Metaheuristics and constraint programming approaches are two of the more important approaches used for generating structural test cases ..."
Abstract
 Add to MetaCart
Structural test case generation has been carried out by various approaches in software testing. Metaheuristics and constraint programming approaches are two of the more important approaches used for generating structural test cases
A Constraint Programming Approach to the Stable Marriage Problem
 IN CP’01
, 2001
"... The Stable Marriage problem (SM) is an extensivelystudied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem. We prove that, in a precise sense, establishing arc consistency ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
free manner. Our results indicate the applicability of Constraint Programming to the domain of stable matching problems in general, many of which are NPhard.
Aircraft Scheduling and Operation  a Constraint Programming Approach
, 2000
"... Given the timetable of flights, an airline has to make schedules for the aircraft. This thesis describes a way to model and solve aircraft assignment (tail assignment) using constraint programming. The solution method provides solutions of good quality, very quickly, for realworld problems. A onem ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
seconds. Constraint programming is a method for solving constraint satisfaction problems; combining: • Enumerative search—where the basic approach is depthfirst search with chronological backtracking. • Consistency techniques (socalled constraint propagation)—that can effectively reduce the search space
A Constraint Programming Approach to Portfolio Selection
 Proceeding of The 13th biennial European Conference on Artificial Intelligence
, 1998
"... . The key idea in Modern Portfolio Theory, as introduced by Markowitz, is to minimize risk which is defined as meanvariance in returns. One method to solve the resulting quadratic programming problem is by converting it into a linear complementarity problem and then solving the latter using special ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
specialized algorithms. An analysis reveals that a linear complementarity problem can be understood as a disjunctive linear programming problem which can be modeled and solved using constraint programming systems such as 2LP or ILOG. Representing the problem in this way facilitates the inclusion of additional
A Constraint Programming Approach to the Hospitals / Residents Problem
 IN WORKSHOP ON MODELLING AND REFORMULATING CONSTRAINT SATISFACTION PROBLEMS AT CP’05
, 2005
"... An instance I of the Hospitals / Residents problem (HR) involves a set of residents (graduating medical students) and a set of hospitals, where each hospital has a given capacity. The residents have preferences for the hospitals, as do hospitals for residents. A solution of I is a stable matching, w ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
generated and realworld instances. Our study suggests that Constraint Programming is indeed an applicable technology for solving this problem, in terms of both theory and practice.
Results 1  10
of
3,102,563