About: Simon de Givry

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Simon de Givry Goto Sponge NotDistinct Permalink

An Entity of Type : foaf:Person, within Data Space : data.idref.fr associated with source document(s)

Attributes	Values
type	Person
sameAs	Givry, Simon de Givry, Simon de Givry, Simon de Givry, Simon de
alternative label	De Givry, Simon
preferred label	Givry, Simon de
name	Simon de Givry
dbpedia-owl:citizenship	http://sws.geonames.org/3017382/
Language	http://lexvo.org/id/iso639-3/fra
isni:identifierValid	0000000356778340
Given name	Simon de
familyName	Givry
has biographical i...tion (Deprecated)	Titulaire d'un doctorat en informatique à l'Ecole nationale supérieure de l'aéronautique et de l'espace en 1998 Chercheur permanent (CR1, HdR) à l'INRAE MIAT, responsable de l'équipe Statistiques et Algorithmes pour la Biologie (SaAB), INRAE, Centre de recherches de Toulouse, Unité de Mathématiques et Informatique Appliquées de Toulouse CASTANET-TOLOSAN (en 2022)
gender	male
ORCID iD	0000-0002-2242-0458
Scopus ID	56667498100
is sameAs of	Givry, Simon de Givry, Simon de Givry, Simon de
is Thesis advisor of	http://www.sudoc.fr/171658248/id http://www.sudoc.fr/171624890/id http://www.sudoc.fr/163739536/id Apprentissage de la structure de réseaux bayésiens, application aux données de génétique-génomique http://www.sudoc.fr/163702950/id Décompositions fonctionnelles et structurelles dans les modèles graphiques probabilistes appliquées à la reconstruction d'haplotypes http://www.sudoc.fr/248008951/id Constraint games revisited http://www.sudoc.fr/244983429/id http://www.sudoc.fr/248036629/id http://www.sudoc.fr/245244646/id Méthodes d'optimisation combinatoire en programmation mathématique, Application à la conception des systèmes de verger-maraîcher http://www.sudoc.fr/264131983/id http://www.sudoc.fr/278970435/id
is Author of	Algorithmes d'optimisation sous contraintes étudiés dans un cadre temps réel http://www.sudoc.fr/048543004/id Solving the Crop Allocation Problem using Hard and Soft Constraints Filtering Decomposable Global Cost Functions Iterated local search with partition crossover for computational protein design A new framework for computational protein design through cost function network optimization Recherche complète à voisinages variables guidée par la décomposition arborescente pour la minimisation d'énergie dans les modèles graphiques Filtrage de fonctions de coût globales décomposables Une comparaison de logiciels d'optimisation sur une large collection de modèles graphiques Contribution of Radiation Hybrids to Genome Mapping in Domestic Animals. Cohérence d'arc virtuelle pour les CSP pondérés Réseaux de contraintes valués Relaxation-Aware Heuristics for Exact Optimization in Graphical Models Exact and approximate inference in graphical models https://hal.archives-ouvertes.fr/hal-02734772#id An Experimental Evaluation of CP/AI/OR Solvers for Optimization in Graphical Models Clique Cuts in Weighted Constraint Satisfaction Résolution du problème d'allocation de cultures par satisfaction de contraintes pondérées Computational protein design as an optimization problem Computational Enzyme Design through deterministic optimization and counting Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization A weighted CSP approach for solving spatio-temporal farm planning problems Pushing Data into CP Models Using Graphical Model Learning and Solving A comparative genome approach to marker ordering Approximate counting with deterministic guarantees for affinity computation Decomposing Global Cost Functions Tractability-preserving Transformations of Global Cost Functions Cost function network-based design of protein–protein interactions: predicting changes in binding affinity Comptage de solutions en exploitant la structure du graphe de contraintes An integer linear programming approach for genome scaffolding Maintaining Virtual Arc Consistency Dynamically during Search Problèmes de Satisfaction de Contraintes Valuées A comparative genome approach to marker ordering RNA expression dataset of 384 sunflower hybrids in field condition http://www.numdam.org/articles/10.1051/ro/2013029#id Statistical confidence measures for genome maps: application to the validation of genome assemblies Computational protein design as a cost function network optimization problem A new local consistency for weighted CSP applied to ncRNA detection. Guaranteed Diversity & Quality for the Weighted CSP Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations Recent algorithmic advances for combinatorial optimization in graphical models Anytime hybrid best-first search with tree decomposition for weighted CSP Solution counting for CSP and SAT with large tree-width Principles and Practice of Constraint Programming. 25th International Conference, CP 2019 Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited Searching RNA motifs and their intermolecular contacts with constraint networks http://www.sudoc.fr/126409978/id Computational protein design as a cost function network optimization problem Guaranteed Discrete Energy Optimization on Large Protein Design Problems Variable neighborhood search for graphical model energy minimization Triangle-based consistencies for cost function networks A new framework for computational protein design through cost function network optimization Filtrage de fonctions de coût globales décomposables Carhta Gene: multipopulation integrated genetic and radiation hybrid mapping Inférence de réseaux de régulation de gènes au travers de scores étendus dans les réseaux bayésiens Algorithme des Poupées Russes exploitant une décomposition arborescente Transcriptomic data of leaves from eight sunflower lines and their sixteen hybrids under water deficit Exact and approximate inference in graphical models: variable elimination and beyond Preface Combining exact WCSP techniques and VNS search for solving MPE Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization Solving the Crop Allocation Problem using Hard and Soft Constraints Filtering decomposable global cost functions Cost Function Networks to Solve Large Computational Protein Design Problems

Faceted Search & Find service v1.13.91 as of Aug 16 2018

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software