Learning during search

Learning during search

Show other versions (1)

La recherche autonome est un nouveau domaine d'intérêt de la programmation par contraintes, motivé par l'importance reconnue de l'utilisation de l'apprentissage automatique pour le problème de sélection de l'algorithme le plus approprié pour une instance donnée, avec une va...

Full description

Bibliographic Details
Main Author:	Arbelaez Rodriguez, Alejandro
Other Authors:	Paris 11
Language:	en
Published:	2011
Subjects:	Portfolio d'algorithmes Apprentissage Automatique Apprentissage Supervisée Problèmes de satisfaction de contraintes Problèmes d'optimisation de combinatoire SAT Recherche locale Portfolio Algorithms Machine Learning Supervised Learning Constraint Satisfaction Problems Constraint Optimization Problems Local Search
Online Access:	http://www.theses.fr/2011PA112063/document

Similar Items

Learning during search
by: Arbelaez Rodriguez, Alejandro
Published: (2011)

Acquisition de contraintes par apprentissage de structures
by: Daoudi, Abderrazak
Published: (2016)

MAX-SAT Problem using Hybrid Harmony Search Algorithm
by: Abu Doush Iyad, et al.
Published: (2018-10-01)

SAT Encodings of Finite CSPs
by: Nguyen, Van-Hau
Published: (2015)

Configuration automatique d’un solveur générique intégrant des techniques de décomposition arborescente pour la résolution de problèmes de satisfaction de contraintes
by: Blet, Loïc
Published: (2015)

Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire
by: Karoui, Wafa
Published: (2010)

Améliorer l'efficacité de l'algorithme CDCL : décompositions arborescentes de grandes instances, CDCL sans saut arrière et CDCL à ordre partiel
by: Monnet, Anthony Jean-Luc
Published: (2013)

FUZZY PROJECT SCHEDULING USING CONSTRAINT PROGRAMMING
by: Marcin RELICH
Published: (2013-06-01)

Harmony search algorithm with adaptive parameter setting for solving large bin packing problems
by: Amol C. Adamuthe, et al.
Published: (2020-09-01)

Solving Sat in a Distributed Cloud: A Portfolio Approach
by: Ngoko Yanik, et al.
Published: (2019-06-01)

Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics
by: Munera Ramirez, Danny
Published: (2016)

Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
by: Abramé, André
Published: (2015)

Méthodes de décomposition pour la résolution des PCSP (Partial Constraint Satisfaction Problem) : application aux problèmes FAP et coloration de graphes
by: Sadeg, Lamia
Published: (2016)

Cellular memetic algorithms
by: Enrique Alba Torres, et al.
Published: (2005-12-01)

Algorithm portfolio based scheme for dynamic optimization problems
by: Jenny Fajardo Calderín, et al.
Published: (2015-08-01)

Intégration de techniques CSP pour la résolution du problème WCSP
by: Paris, Nicolas
Published: (2014)

An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems
by: Boxin Guan, et al.
Published: (2019-08-01)

Contributions to Convergence Analysis of Noisy Optimization Algorithms
by: Astete morales, Sandra
Published: (2016)

Algorithm to Count the Number of Signed Paths in an Electrical Network via Boolean Formulas
by: Belem Merino, et al.
Published: (2012-03-01)

Optimisation des plans de test des charges utiles des satellites de télécommunication
by: Maillet, Caroline
Published: (2012)

Automatisation de la synthèse d’architectures appliquée aux aéronefs à voilure tournante
by: Hartmann, Chris
Published: (2018)

Dynamic ICSP Graph Optimization Approach for Car-Like Robot Localization in Outdoor Environments
by: Zhan Wang, et al.
Published: (2019-09-01)

Scholastic aptitude test in mathematics as a predictor of student selection of algebraic versus geometric approaches to problem solving /
by: Price, Richard Lionel
Published: (1969)

Programación con restricciones dinámica
by: Broderick Crawford, et al.
Published: (2009-07-01)

Graph Neural Networks for Maximum Constraint Satisfaction
by: Jan Tönshoff, et al.
Published: (2021-02-01)

A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark
by: Fengcai Qiao, et al.
Published: (2018-02-01)

Apprentissage en résolution de problèmes : influence du mode d'instruction
by: Dupays, Aurore
Published: (2011)

Narrowing Support Searching Range in Maintaining Arc Consistency for Solving Constraint Satisfaction Problems
by: Hongbo Li
Published: (2017-01-01)

A Hybrid Learnt Clause Evaluation Algorithm for SAT Problem
by: Guanfeng Wu, et al.
Published: (2018-11-01)

Search, propagation, and learning in sequencing and scheduling problems
by: Siala, Mohamed
Published: (2015)

Accelerating backtrack search with a best-first-search strategy
by: Mann Zoltán Ádám, et al.
Published: (2014-12-01)

Unfolding RNA 3D structures for secondary structure prediction benchmarking
by: C-Parent, Gabriel
Published: (2017)

Quantum Computing Approaches for Mission Covering Optimization
by: Alsing, P.M, et al.
Published: (2022)

Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU)
by: Delevacq, Audrey
Published: (2013)

Modélisation et résolution de problèmes de décision et d'optimisation hiérarchiques en utilisant des contraintes quantifiées
by: Vautard, Jérémie
Published: (2010)

Efficient local search for several combinatorial optimization problems
by: Buljubasic, Mirsad
Published: (2015)

An Evolutionary Variable Neighbourhood Search for the Unrelated Parallel Machine Scheduling Problem
by: Salwani Abdullah, et al.
Published: (2021-01-01)

Ordonnancement cumulatif avec dépassements de capacité : Contrainte globale et décompositions
by: De Clercq, Alexis
Published: (2012)

On Some Combinatorial Optimization Problems : Algorithms and Complexity
by: Uppman, Hannes
Published: (2015)

The Approximability of Learning and Constraint Satisfaction Problems
by: Wu, Yi
Published: (2010)