Filters








2,209 Hits in 5.6 sec

Greater Efficiency for Conditional Constraint Satisfaction [chapter]

Mihaela Sabin, Eugene C. Freuder, Richard J. Wallace
2003 Lecture Notes in Computer Science  
Reformulating CCSPs into standard CSPs has been proposed in order to bring the full arsenal of CSP algorithms to bear.  ...  The advanced algorithms extend forward checking and maintaining arc consistency to CCSPs.  ...  We extend a random standard CSP generation model [11] to produce random activity constraints, and use the model to implement a random conditional CSP generator.  ... 
doi:10.1007/978-3-540-45193-8_44 fatcat:cobbed2km5ghznpnlfadptjtza

Quantum Computing for Artificial Intelligence Based Mobile Network Optimization [article]

Furqan Ahmed, Petri Mähönen
2021 arXiv   pre-print
As a case study, we discuss root sequence index (RSI) assignment problem - an important LTE/NR physical random access channel configuration related automation use-case.  ...  The non-quantum advantage is due to the fact that current implementation is a semi-quantum proof-of-concept algorithm. Also, the results depend on the type of quantum computer used.  ...  On the other hand, performance management data consists of various performance counters collected by the RAN. Compared to configuration management data, it is updated very frequently.  ... 
arXiv:2106.13917v1 fatcat:dfg2cuansvcphdhofyu5cmvzim

Locked Constraint Satisfaction Problems

Lenka Zdeborová, Marc Mézard
2008 Physical Review Letters  
While the phase diagram can be found easily, these problems, in their clustered phase, are extremely hard from the algorithmic point of view: the best known algorithms all fail to find solutions.  ...  We introduce and study the random "locked" constraint satisfaction problems.  ...  The main idea of the family of algorithms is to perform a random walk in configurational space, trying to minimize the number of unsatisfied constraints.  ... 
doi:10.1103/physrevlett.101.078702 pmid:18764587 fatcat:lwlp3abionh3fl2mezefji3uqy

Reasoning with Numeric and Symbolic Time Information

Malek Mouhoub
2004 Artificial Intelligence Review  
Experimental tests were performed on randomly generated temporal constraint problems as well as on scheduling problems in order to compare and evaluate the performance of the different methods we propose  ...  Constraint satisfaction techniques are then used to manage the different time information by solving the CSP.  ...  Table 3 presents tests performed on randomly generated consistent problems of size 200 each, characterized as shown in the table.  ... 
doi:10.1023/b:aire.0000007179.60276.39 fatcat:aqscy4t2vzdc3bbqch6z6ej36y

Flexible and Efficient Long-Range Planning Through Curious Exploration [article]

Aidan Curtis, Minjian Xin, Dilip Arumugam, Kevin Feigelis, Daniel Yamins
2020 arXiv   pre-print
Here, we propose the Curious Sample Planner (CSP), which fuses elements of TAMP and DRL by combining a curiosity-guided sampling strategy with imitation learning to accelerate planning.  ...  We explore the use of a variety of curiosity metrics with CSP and analyze the types of solutions that CSP discovers.  ...  To give the baseline algorithms the best chance of working, we thus tested them with random trial resetting, characterized by a reset with probability 1e-4 after each macro-action.  ... 
arXiv:2004.10876v2 fatcat:4ioyp3qubnhvtg7txjjkzuixp4

Adaptation using constraint satisfaction techniques [chapter]

Lisa Purvis, Pearl Pu
1995 Lecture Notes in Computer Science  
We have tested our methodology in the configuration design and assembly sequence generation domains. Analysis of performance and results will be shown at the end of this paper.  ...  CSPs into a globally consistent solution for the new problem.  ...  Both configuration design using backtracking and assembly sequence generation have been characterized as NP-hard problems.  ... 
doi:10.1007/3-540-60598-3_26 fatcat:dupkpmfmp5bizhjwezm6gshagq

A General Framework Based on Machine Learning for Algorithm Selection in Constraint Satisfaction Problems

José C. Ortiz-Bayliss, Ivan Amaya, Jorge M. Cruz-Duarte, Andres E. Gutierrez-Rodriguez, Santiago E. Conant-Pablos, Hugo Terashima-Marín
2021 Applied Sciences  
in terms of consistency checks) of the best performing heuristic (KAPPA), on average, by 49% for the instances considered for this work.  ...  Our data suggest that these algorithms outperform the best performing algorithm on a set of test instances.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app11062749 fatcat:x67kst2jdfgwvbwrr4x5w7gjte

Improving genetic algorithm using arc consistency technic

Meriem Zouita, Sadok Bouamama, Kamel Barkaoui
2019 Procedia Computer Science  
First, we generated the genetic algorithm without integrating the arc consistency.  ...  First, we generated the genetic algorithm without integrating the arc consistency.  ...  After generating the algorithm and finding the solution. We have switched to the implementation of a random CSP [4] [5] .  ... 
doi:10.1016/j.procs.2019.09.309 fatcat:yfr7fnydarfddcdqyj6veudhai

A Generic Framework for Local Search: Application to the Sudoku Problem [chapter]

T. Lambert, E. Monfroy, F. Saubion
2006 Lecture Notes in Computer Science  
Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications. CSPs can be solved with complete methods or incomplete methods.  ...  In this paper, we are concerned with the design of a generic framework to model local search as the computation of a fixed point of functions and to solve the Sudoku problem.  ...  Inspired by [2] , the proof partially relies on an invariant ∀f ∈ F − G, f (d) = d of the "while" loop in the algorithm. This invariant is preserved by our characterization of the update function.  ... 
doi:10.1007/11758501_86 fatcat:hjjbzf6d3zfh7pbzxtnu3uvsca

Pairwise testing for software product lines: comparison of two approaches

Gilles Perrouin, Sebastian Oster, Sagar Sen, Jacques Klein, Benoit Baudry, Yves le Traon
2011 Software quality journal  
Hence, one possible option is to test SPLs by generating test configurations that cover all possible t feature interactions (t-wise).  ...  To evaluate the respective merits of the approaches, measures such as the number of generated test configurations and the similarity between them are provided. 2 Gilles Perrouin et al.  ...  This research was partly funded by the NAPLES project funded by the Walloon Region (Belgium).  ... 
doi:10.1007/s11219-011-9160-9 fatcat:cwslxc27czertcfi5xxitqybxa

Message-Passing Algorithms for Non-Linear Nodes and Data Compression

Stefano Ciliberti, Marc Mézard, Riccardo Zecchina
2006 ComPlexUs  
The theoretical performance of such a Parity Source Coder can attain the optimal limit predicted by the general rate-distortion theory.  ...  However, in order to turn this approach into an efficient compression code (with fast encoding/decoding algorithms) one must depart from parity checks and use some general random gates.  ...  The theoretical performance of these nodes are quite close to the PSC case (the XOR node, characterized by the sequence {2, 0, 2, 0}). III.  ... 
doi:10.1159/000094188 fatcat:ia32aqnwizgbvcxktnts2hoamu

Message passing algorithms for non-linear nodes and data compression [article]

S. Ciliberti, M. Mezard, R. Zecchina
2005 arXiv   pre-print
The theoretical performance of such a Parity Source Coder can attain the optimal limit predicted by the general rate-distortion theory.  ...  However, in order to turn this approach into an efficient compression code (with fast encoding/decoding algorithms) one must depart from parity checks and use some general random gates.  ...  The theoretical performance of these nodes are quite close to the PSC case (the XOR node, characterized by the sequence {2, 0, 2, 0}). III.  ... 
arXiv:cond-mat/0508723v1 fatcat:jlpsbfbgsjbiriuykpooccrsnq

Hybrid strategies of enumeration in constraint solving
English

Monfroy Eric, Crawford Broderick, Soto Ricardo, Fern, Paredes o
2011 Scientific Research and Essays  
Enumeration strategies (that is, selection of a variable and a value of its domain) are crucial components of Constraint Programming: they significantly influence the performances of the solving process  ...  In this paper, we propose to use Local Search in order to help and guide enumeration: we extend the usual variable selection strategies of constraint programming and we perform the value selection with  ...  The result of the LS is thus a local optimum, the best configuration w.r.t. the evaluation function. A configuration consists in giving a tentative value to each non instantiated variable of the CSP.  ... 
doi:10.5897/sre11.891 fatcat:2qgnpbwmjbcslhzsvp6u63h5n4

Anytime Diagnosis for Reconfiguration [article]

Alexander Felfernig and Rouven Walter and Jose A. Galindo and David Benavides and Seda Polat-Erdeniz and Muesluem Atas and Stefan Reiterer
2021 arXiv   pre-print
We evaluate the algorithm with regard to performance and diagnosis quality using a configuration benchmark from the domain of feature models and an industrial configuration knowledge base from the automotive  ...  Results show that FlexDiag helps to significantly increase the performance of direct diagnosis search with corresponding quality tradeoffs in terms of minimality and accuracy.  ...  ., the consistency of AC is not checked by the algorithm.  ... 
arXiv:2102.09880v1 fatcat:uqobnlvspzhrpgaq4xj2helvee

Open Constraint Satisfaction [chapter]

Boi Faltings, Santiago Macho-Gonzalez
2002 Lecture Notes in Computer Science  
We report on experiments that show strong performance of such methods over others where gathering information and solving the CSP are separated.  ...  We examine how such a distributed setting affects changes the assumptions underlying most CSP algorithms, and show how solvers can be augmented with an information gathering component that allows openworld  ...  We tested the performance of the techniques we described on synthetic, randomly generated constraint satisfaction problems.  ... 
doi:10.1007/3-540-46135-3_24 fatcat:gt3avtohpzcsjcquvkizqhxvi4
« Previous Showing results 1 — 15 out of 2,209 results