10 Hits in 5.3 sec

Weight-Based Variable Ordering in the Context of High-Level Consistencies [article]

Robert J. Woodward, Berthe Y. Choueiry
2017 arXiv   pre-print
As originally defined, this heuristic increments the weight of the constraint that causes a domain wipeout (i.e., a dead-end) when enforcing arc consistency during search.  ...  In this paper, we investigate how weights should be updated in the context of two high-level consistencies, namely, singleton (POAC) and relational consistencies (RNIC).  ...  First, NIC was originally proposed for binary CSPs and the neighborhoods in NIC likely grow too large on non-binary CSPs; second, RNIC can operate on different dual graph structures to save time.  ... 
arXiv:1711.00909v1 fatcat:teqedeg4xvcgtojlrdh4dcs7zy

Constraint Propagation [chapter]

Christian Bessiere
2006 Foundations of Artificial Intelligence  
Thanks also to Eric Bourreau for having checked the section on specific constraints, to Peter Stuckey for his advice for choosing the names of the different consistencies on bounds, to Roland Yap for some  ...  Freuder for the epigraph he kindly gave me for introducing this report.  ...  Since 2-inverse consistency is the same as 2-consistency, the simplest non trivial such inverse consistency is 3-inverse consistency, or path-inverse consistency (PIC), as called in [57] .  ... 
doi:10.1016/s1574-6526(06)80007-6 fatcat:yths5ayfpnb4hpc3o3i353xqw4

Guided local search and its application to the traveling salesman problem

Christos Voudouris, Edward Tsang
1999 European Journal of Operational Research  
Guided Local Search can be combined with the neighborhood reduction scheme of Fast Local Search which significantly speeds up the operations of the algorithm.  ...  Guided Local Search sits on top of local search heuristics and has as a main aim to guide these procedures in exploring efficiently and effectively the vast search spaces of combinatorial optimization  ...  For more information on GENET and related techniques for CSP and SAT problems the reader can refer to the following publications [7, 36, 43] .  ... 
doi:10.1016/s0377-2217(98)00099-x fatcat:gepmcneg5bfxtmohh5inukwpim

Organizing and Editorial Committee [chapter]

1989 Processing of Complex Ores  
Hence, the uniqueness of irregular splits is conserved, as long as b and c are constrained to be regions.  ...  Please note, that this property also holds for a model of the nearness relation NR which is defined in the RCC framework [9] according to (2).  ...  ACKNOWLEDGEMENTS We would like to thank the referees for their comments, which helped improve this paper.  ... 
doi:10.1016/b978-0-08-037283-9.50004-4 fatcat:3ollyqcecfel7et32k5mvetzhe

Constraint Satisfaction Problems [chapter]

Grard Verfaillie, Thomas Schiex
Decision-making Process  
As an example, we show how a simple depth-based additive cost model of the tree can be learned on-line.  ...  Unfortunately, it is rarely clear a priori which algorithm will be most appropriate for a particular problem.  ...  We also thank Peter Stock, who used his non-Boolean Davis-Putnam program to filter out the unsatisfiable instances from our suite of randomly-generated nb-formulas.  ... 
doi:10.1002/9780470611876.ch6 fatcat:emwz4ax4tbc7bfcreha75g56sy

Emergency rapid mapping with drones: models and solution approaches for offline and online mission planning

Katharina Diana Glock
Please note that we adapted the formulation of Yu et al. (2014) for reasons of consistency to our notation.  ...  The results of the proposed two-phase multi-start adaptive large neighborhood search (2MLS) and two-phase multi-start adaptive large neighborhood search (2MLS)-f on benchmark instances for the TOP highlight  ...  Di erence between the objective value for the best and the n reg -th best insertion position for i δ obj Objective value delta between solutions in reheating scheme  ... 
doi:10.5445/ir/1000124518 fatcat:uadhxmoeafe67lozcrvu476vwi

Scientific Visualization (Dagstuhl Seminar 11231) Outdoor and Large-Scale Real-World Scene Analysis. 15th Workshop Theoretic Foundations of Computer Vision

Min Chen, Hans Hagen, Charles Hansen, Arie Kaufman, Martin Dyer, Uriel Feige, Alan Frieze, Marek Karpinski, Frank Dellaert, Jan-Michael Frahm, Marc Pollefeys, Bodo Rosenhahn
2011 unpublished
Thanks go to Mathias Hauptmann for his help in collecting abstracts of the talks and other related materials for these Proceedings.  ...  We thank Annette Beyer and Angelika Mueller-von Brochowski for their continuous support and help in organizing this workshop.  ...  In effect, for most random CSPs the precise threshold for the existence of solutions assignments remains unknown.  ... 

Quality of Experience: From Assessment to Application (Dagstuhl Seminar 15022) Understanding Complexity in Multiobjective Optimization (Dagstuhl Seminar 15031) Model-driven Algorithms and Architectures for Self-Aware Computing Systems (Dagstuhl Seminar 15041) Artificial and Computational Intelligence in Games: Integration (Dagstuhl Seminar 15051)

Michael Philippsen, Pascal Felber, Michael Scott, J Eliot, Katrien De Moor, Markus Fiedler, Peter Reichl, Martín Varela, Salvatore Greco, Kathrin Klamroth, Joshua Knowles, Günter Rudolph (+13 others)
2015 unpublished
The example problems mentioned in this report may serve as a first benchmark for such approaches.  ...  Furthermore, a self-adaptive system consists of managed resources and the adaptation logic.  ...  In the discussion, ASP stood as the representative for a broad class of approaches based on applying exhaustive search to constraint satisfaction problems (CSPs).  ... 

Issue 4-May 2012-Mastering Complexity: an Overview Mastering Complexity Mastering Complexity: an Overview

Claude Barrouil
Elie for the SimSky project, A. Joulia for the 4DCoGC project, P. Siron and M. Adelantado for the CERTI. The authors would also like to express special gratitude to Dr. H.  ...  Foisseau for his valuable contributions.  ...  Conflict solving Conflict solving consists in adapting the behavior of the machine and the information sent to the human operator, at least for a while.  ... 

Scheduling of flexible manufacturing systems integrating petri nets and artificial intelligence methods

A Reyes Moro
As we will see, however, the distinction is blurred in practice as some approaches (for example, those based on heuristics) commonly employ measures of schedule quality within the scheduling algorithm  ...  This work builds on existing results that clearly show the convenience of PNs as a modelling tool for FIVIS. It addresses the problem of the integration of PN and Al based search methods.  ...  However, if we eventually 16 Such a strategy is known as a non-delay.  ... 
doi:10.24377/ljmu.t.00005527 fatcat:c6eat7s7xnd2tpaf3kybr3jseu