Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles

Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles

Show other versions (1)

L'étude expérimentale d'algorithmes est un sujet crucial dans la conception de nouveaux algorithmes, puisque le contexte d'évaluation influence inévitablement la mesure de la qualité des algorithmes. Le sujet particulier qui nous intéresse dans l'étude expérimentale est la pertin...

Full description

Bibliographic Details
Main Author:	Weber, Valentin
Other Authors:	Grenoble
Language:	fr
Published:	2013
Subjects:	Difficulté d'instance Modification d'instances Science expérimentale des algorithmes Fixed-parameter tractability (FPT) Problème du voyageur de commerce Instance hardness Instance modification Empirical science of algorithms Traveling salesman problem (TSP) 510 004
Online Access:	http://www.theses.fr/2013GRENM014/document

Similar Items

Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles
by: Weber, Valentin
Published: (2013)

A modular approach to object initialization for Pharo
by: Naddeo, Marco
Published: (2017)

Deep learning compact and invariant image representations for instance retrieval
by: Morère, Olivier André Luc
Published: (2016)

Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems
by: Liu, Yang
Published: (2010)

Apports de modèles de comparaison structurelle et sémantique à la synchronisation de la maquette numérique de construction
by: Arthaud, Geoffrey
Published: (2007)

Salient object detection and segmentation in videos
by: Wang, Qiong
Published: (2019)

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem
by: Zhen Zhang, et al.
Published: (2021-01-01)

Semi-supervised co-selection : instances and features : application to diagnosis of dry port by rail
by: Makkhongkaew, Raywat
Published: (2016)

Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces
by: Carpenter, Timothy E.
Published: (2019)

Practical Access to Dynamic Programming on Tree Decompositions
by: Max Bannach, et al.
Published: (2019-08-01)

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization
by: Alonso Vela, et al.
Published: (2021-01-01)

Apprentissage autosupervisé de modèles prédictifs de segmentation à partir de vidéos
by: Luc, Pauline
Published: (2019)

Parameterized Complexity of Maximum Edge Coloring in Graphs
by: Goyal, Prachi
Published: (2018)

Multiple-instance learning with pairwise instance similarity
by: Yuan Liming, et al.
Published: (2014-09-01)

On Covering Points with Conics and Strips in the Plane
by: Tiwari, Praveen 1985-
Published: (2013)

Special Issue on Graph Algorithms
by: Jesper Jansson
Published: (2013-08-01)

Optimal Representative Distribution Margin Machine for Multi-Instance Learning
by: Tianxiang Luan, et al.
Published: (2020-01-01)

Appeal Court as the Court of the First Instance
by: Morozova A. S.
Published: (2015-04-01)

Automated simultaneous assignment of bond orders and formal charges
by: Ivan D. Welsh, et al.
Published: (2019-03-01)

THE EXECUTION INSTANCE OF THE JUDICIAL JUDGEMENTS SENTENCED IN THE LITIGATIONS OF ADMINISTRATIVE CONTENTIOUS
by: ADRIANA ELENA BELU, et al.
Published: (2012-05-01)

Multiple-Instance Learning Approach via Bayesian Extreme Learning Machine
by: Peipei Wang, et al.
Published: (2020-01-01)

The Parameterized Complexity of the Rainbow Subgraph Problem
by: Falk Hüffner, et al.
Published: (2015-02-01)

Algorithmes d'approximation à mémoire limitée pour le traitement de grands graphes : le problème du Vertex Cover
by: Campigotto, Romain
Published: (2011)

Gestion de l'évolution dans les bases de connaissances : une approche par les règles
by: Bounaas, Fethi
Published: (1995)

Resource scheduling of workflow multi-instance migration based on the shuffled leapfrog algorithm
by: Yang Mingshun, et al.
Published: (2015-01-01)

FTRLIM: Distributed Instance Matching Framework for Large-Scale Knowledge Graph Fusion
by: Hongming Zhu, et al.
Published: (2021-05-01)

Vertex Cover Reconfiguration and Beyond
by: Amer E. Mouawad, et al.
Published: (2018-02-01)

Localized instance fusion of MRI data of Alzheimer’s disease for classification based on instance transfer ensemble learning
by: Xiaoheng Tan, et al.
Published: (2018-05-01)

Where the really hard problems aren’t
by: Joeri Sleegers, et al.
Published: (2020-01-01)

Instance Sequence Queries for Video Instance Segmentation with Transformers
by: Zhujun Xu, et al.
Published: (2021-06-01)

Studies on Optimal Colorful Structures in Vertex-Colored Graphs
by: Pham, Hong Phong
Published: (2018)

Backup or Not: An Online Cost Optimal Algorithm for Data Analysis Jobs Using Spot Instances
by: Liduo Lin, et al.
Published: (2020-01-01)

Reconciling multiple genes trees via segmental duplications and losses
by: Riccardo Dondi, et al.
Published: (2019-03-01)

Co-Clustering under the Maximum Norm
by: Laurent Bulteau, et al.
Published: (2016-02-01)

String to String Correction Kernelization
by: Watt, Nathaniel
Published: (2013)

The effects of negative instances and focusing on conjunctive concept learning /
by: Stout, David Lee
Published: (1982)

IRDDS: Instance reduction based on Distance-based decision surface
by: J. Hamidzadeh
Published: (2015-10-01)

Improving Multi-Instance Multi-Label Learning by Extreme Learning Machine
by: Ying Yin, et al.
Published: (2016-05-01)

Large‐scale set partitioning problems: Some real‐world instances hide a beneficial structure
by: Luca Coslovich, et al.
Published: (2006-03-01)

Pricing and Profit Management Models for SaaS Providers and IaaS Providers
by: In Lee
Published: (2021-02-01)