Filters








474,425 Hits in 4.5 sec

Continuous Search in Constraint Programming

Alejandro Arbelaez, Youssef Hamadi, Michele Sebag
2010 2010 22nd IEEE International Conference on Tools with Artificial Intelligence  
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their problems.  ...  Continuous Search comes in two modes: the functioning mode solves the user's problem instances using the current heuristics model; the exploration mode reuses these instances to train and improve the heuristics  ...  CONTINUOUS SEARCH IN CONSTRAINT PROGRAMMING The Continuous Search paradigm, illustrated on Figure 1 , considers a functioning system governed from a heuristics model (which could be expressed as e.g.,  ... 
doi:10.1109/ictai.2010.17 dblp:conf/ictai/ArbelaezHS10 fatcat:k4fyc5gifjdz5cq6yjj37dv2se

Continuous Search in Constraint Programming [chapter]

Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag
2011 Autonomous Search  
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their problems.  ...  Continuous Search comes in two modes: the functioning mode solves the user's problem instances using the current heuristics model; the exploration mode reuses these instances to train and improve the heuristics  ...  CONTINUOUS SEARCH IN CONSTRAINT PROGRAMMING The Continuous Search paradigm, illustrated on Figure 1 , considers a functioning system governed from a heuristics model (which could be expressed as e.g.,  ... 
doi:10.1007/978-3-642-21434-9_9 fatcat:fvx2osddi5hvva2nl7yelbjw5q

Monadic constraint programming

TOM SCHRIJVERS, PETER STUCKEY, PHILIP WADLER
2009 Journal of functional programming  
Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible. 1.  ...  A constraint programming system combines two essential components: a constraint solver and a search engine.  ...  a further step in the increasingly abstract view of search and constraint programming.  ... 
doi:10.1017/s0956796809990086 fatcat:u5lpxlckkbh2fam7udd3vejixa

High-Level Nondeterministic Abstractions in C++ [chapter]

Laurent Michel, Andrew See, Pascal Van Hentenryck
2006 Lecture Notes in Computer Science  
This paper presents high-level abstractions for nondeterministic search in C++ which provide the counterpart to advanced features found in recent constraint languages.  ...  Their efficiency is demonstrated by comparing their performance with the C++ library Gecode, both for programming search procedures and search engines.  ...  This paper is an attempt to mirror, in constraint programming libraries, the high-level nondeterministic abstractions of modern constraint programming languages.  ... 
doi:10.1007/11889205_27 fatcat:dporaa5ab5fknhetszxzekgwsm

Logic, Optimization, and Constraint Programming

John N. Hooker
2002 INFORMS journal on computing  
It traces the history of logic-based methods in optimization and the development of constraint programming in artificial intelligence.  ...  (Optimization, Constraint programming, Logic-based methods, Artificial Intelligence)  ...  Constraint propagation applied to (f) and (g) helps to keep the search tree in check.  ... 
doi:10.1287/ijoc.14.4.295.2828 fatcat:22kiqfcqqvfcppogsgbd5xqj2y

A Search-Infer-and-Relax Framework for Integrating Solution Methods [chapter]

J. N. Hooker
2005 Lecture Notes in Computer Science  
These include continuous relaxations for global constraints, the linking of integer and constraint programming via Benders decomposition, constraint propagation in global optimization, relaxation bounds  ...  in local search and GRASPs, and many others.  ...  Popular forms of relaxation include the constraint store in constraint programming, continuous relaxations of 0-1 inequalities or global constraints, and the master problem in Benders decomposition and  ... 
doi:10.1007/11493853_19 fatcat:kouuurltlfe3naogbjedsxfyte

Structured Traversal of Search Trees in Constraint-logic Object-oriented Programming [article]

Jan C. Dageförde, Finn Teegen
2019 arXiv   pre-print
In this paper, we propose an explicit, non-strict representation of search trees in constraint-logic object-oriented programming.  ...  In particular, the last two strategies allow for a complete search, which is novel in constraint-logic object-oriented programming and highlights our main contribution.  ...  The authors appreciate the valuable input of those that participated in the discussions; in particular, Sandra Dylus, Jan Christiansen, Jan Rasmus Tikovsky, and Michael Hanus.  ... 
arXiv:1908.10264v1 fatcat:ahhqu4zj3nfw5axxzp6x6kebca

Introduction to the fast track issue for CPAIOR 2015

L. Michel
2015 Constraints  
in Barcelona, Spain.  ...  , dynamic programming, Lagrangian and convex relaxations and heuristic functions based on constraint relaxation.  ...  In A Constraint-Based Local Search Backend for MiniZinc, Björdal et al. explore an extension to the MiniZinc modeling language meant to support Constraint-Based Local Search.  ... 
doi:10.1007/s10601-015-9194-x fatcat:oz2zrhlbrzdq3pt6nd23grdege

Chapter 4 Constraint Programming [chapter]

Francesca Rossi, Peter van Beek, Toby Walsh
2008 Foundations of Artificial Intelligence  
The basic idea in constraint programming is that the user states the constraints and a general purpose constraint solver is used to solve them.  ...  Constraint Propagation One of the most important concepts in the theory and practice of constraint programming is that of local consistency.  ...  The simplest local search algorithms continually make moves in the graph until all moves to neighbors would result in an increase in the cost function.  ... 
doi:10.1016/s1574-6526(07)03004-0 fatcat:vrrxlx2nhjaajj27uvoepcefqa

On the intersection of AI and OR

CARLA P. GOMES
2001 Knowledge engineering review (Print)  
OR has relied heavily on mathematical programming formulations such as integer and linear programming, while AI has developed constraint-based search techniques and inference methods.  ...  The duality of search and inference is described in terms of a generalisation of the notion of duality for classic linear programming (LP), thereby providing a general method for a sensitivity analysis  ...  Caseau et al. (2001) exploit the combination of local search and global search techniques in a constraint-programming framework.  ... 
doi:10.1017/s0269888901000066 fatcat:yp6fyeaknzcmvbzjq4wsvn7bhy

Page 336 of The Journal of Industrial Engineering Vol. 17, Issue 6 [page]

1966 The Journal of Industrial Engineering  
Continued search then was employed to obtain more significant digits in the multiplier.  ...  Successive scales could continue to be constructed until either the system weight constraint was met exactly or sufficient search was employed to assure that the final solu- tion was at hand.  ... 

Page 17 of The Journal of the Operational Research Society Vol. 52, Issue 1 [page]

2001 The Journal of the Operational Research Society  
If the relaxed cost is greater, then there is no point in continuing to search along that branch of the tree.  ...  Sciences, Brunel University, UK Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems.  ... 

Page 585 of The Journal of the Operational Research Society Vol. 50, Issue 6 [page]

1999 The Journal of the Operational Research Society  
S Heipcke—Comparing constraint programming and mathematical programming approaches to discrete optimisation—the change problem 585 Constraint programming Commentary Mathematical programming constraint  ...  In this case, typically the derived implications are only valid locally in a part of the search tree.  ... 

A New Method for the Global Solution of Large Systems of Continuous Constraints [chapter]

Mark S. Boddy, Daniel P. Johnson
2003 Lecture Notes in Computer Science  
system of quadratic constraints that arise as subproblems.  ...  Application of the Constrained Envelope Scheduling (CES) approach required development of the Gradient Constraint Equation Subdivision (GCES) algorithm, a novel global feasibility solver for the large  ...  This scheduler employs an architecture described previously [4] for the coordinated operation of discrete and continuous solvers. There is a considerable work remaining on all fronts.  ... 
doi:10.1007/978-3-540-39901-8_11 fatcat:gu7pgcskevfjhhj7xh25mta7ya

Constraints in Procedural and Concurrent Languages [chapter]

Thom Frühwirth, Laurent Michel, Christian Schulte
2006 Foundations of Artificial Intelligence  
constraints and programming the search.  ...  Search strategies can be expressed via policies for the management of the captured continuations and embedded in Search Controllers that parameterize the search. 1.  ... 
doi:10.1016/s1574-6526(06)80017-9 fatcat:devduzw4zjeyne7vppo7mevdda
« Previous Showing results 1 — 15 out of 474,425 results