Schiex, Thomas

Overview

Works:	30 works in 51 publications in 2 languages and 551 library holdings
Genres:	Instructional and educational works Conference papers and proceedings
Roles:	Editor, Thesis advisor, Contributor, htt, Opponent, Author, Publishing director, Other
Classifications:	QA279.7, 006.3

Publication Timeline

Most widely held works by Thomas Schiex

Principles and Practice of Constraint Programming : 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings by CP (Conference)( )

9 editions published in 2019 in English and held by 247 WorldCat member libraries worldwide

This book constitutes the proceedings of the 25th International Conference on Principles and Practice of Constraint Programming, CP 2019, held in Stamford, CT, USA, France, in September/October 2019. The 44 full papers presented in this volume were carefully reviewed and selected from 118 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: technical track; application track; multi-agent and parallel CP track; testing and verification track; CP and data science track; computational sustainability; and CP and life sciences track. --

Intelligence artificielle et informatique théorique by J.-M Alliot( Book )

5 editions published between 1993 and 2002 in French and Undetermined and held by 175 WorldCat member libraries worldwide

Sequential decision-making problems : representation and solution by Cédric Pralet( Book )

3 editions published in 2010 in English and held by 76 WorldCat member libraries worldwide

I.A. et Informatique Theorique by J.-M Alliot( )

1 edition published in 2003 in French and held by 9 WorldCat member libraries worldwide

CONCEPTION ET IMPLEMENTATION D'UN DIALECTE LISP PARESSEUX : HELP by Thomas Schiex( Book )

2 editions published in 1991 in French and held by 3 WorldCat member libraries worldwide

CETTE THESE S'INSERE DANS LA CONTINUATION DE LA THESE DU PR. CAYROL SUR LES LANGAGES PERMETTANT LA MANIPULATION DE STRUCTURES DE DONNEES INFINIES DENOMBRABLES (BASEE SUR LE LANGAGE PSIL). NOUS ETUDIONS UN NOUVEAU LANGAGE QUI HERITE DE CARACTERISTIQUES DE PSIL ET DE SCHEME. UNE DEFINITION SEMANTIQUE, LA DESCRIPTION DE L'IMPLEMENTATION EFFICACE DE L'INTERPRETE SUR MAINTOSH II ET L'ETUDE D'UN COMPILATEUR FORMENT L'ESSENTIEL DE LA THESE. UN MANUEL HELP COMPLET EST INCLUS. FINALEMENT, NOUS COMPARONS NOTRE LANGAGE AVEC DES MEMBRES HABITUELS DE LA COMMUNAUTE FONCTIONNELLE (HOPE, SCHEME..). DE FUTURES DIRECTIONS DE RECHERCHES SONT EXPOSEES

Advanced methods to solve the maximum parsimony problem by Karla Esmeralda Vazquez Ortiz( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

La reconstruction phylogénétique est considérée comme un élément central de divers domaines comme l'écologie, la biologie et la physiologie moléculaire pour lesquels les relations généalogiques entre séquences d'espèces ou de gènes, représentées sous forme d'arbres, peuvent apporter des éclairages significatifs à la compréhension de phénomènes biologiques. Le problème de Maximum de Parcimonie est une approche importante pour résoudre la reconstruction phylogénétique en se basant sur un critère d'optimalité pour lequel l'arbre comprenant le moins de mutations est préféré. Dans cette thèse nous proposons différentes méthodes pour s'attaquer à la nature combinatoire de ce problème NP-complet. Premièrement, nous présentons un algorithme de Recuit Simulé compétitif qui nous a permis de trouver des solutions de meilleure qualité pour un ensemble de problèmes. Deuxièmement, nous proposons une nouvelle technique de Path-Relinking qui semble intéressante pour comparer des arbres mais pas pour trouver des solutions de meilleure qualité. Troisièmement, nous donnons le code d'une implantation sur GPU de la fonction objectif dont l'intérêt est de réduire le temps d'exécution de la recherche pour des instances dont la longueur des séquences est importante. Finalement, nous introduisons un prédicteur capable d'estimer le score optimum pour un vaste ensemble d'instances avec une très grande précision

LeARN: a platform for detecting, clustering and annotating non-coding RNAs by Céline Noirot( )

1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide

Formalisme CSP et localisation de motifs structurés dans les textes génomiques by Patricia Thérault( Book )

2 editions published in 2004 in French and held by 2 WorldCat member libraries worldwide

Localisation de gènes et variants par intégration d'informations by Sylvain Foissac( Book )

2 editions published in 2004 in French and held by 2 WorldCat member libraries worldwide

As more genomes are sequenced, the exact localisation of protein-coding genes in genomic DNA sequences is a major challenge in bioinformatics and modern biology. This work is based on a gene finding software (EuGène) that integrates several sources of information in a non-probabilistic graph-based gene structure model (DAG). A weighting parameters estimation method based on a stochastic optimization process has been designed to allow the incorporation of new types of data, like inter- and intra-genomic homology information. The problem of predicting several alternatively spliced variants for one gene has also been adressed by including a transcript data analysis into the global gene finding process, resulting in a new extrinsic/intrinsic integrative approach

Strong consistencies for weighted constraint satisfaction problems by Thi Hong Hiep Nguyen( Book )

2 editions published in 2015 in English and held by 2 WorldCat member libraries worldwide

This thesis focuses on strong local consistencies for solving optimization problems in cost function networks (or weighted constraint networks). These methods provide the lower bound necessary for Branch-and-Bound search. We first study the Virtual arc consistency, one of the strongest soft arc consistencies, which is enforced by iteratively establishing hard arc consistency in a sequence of classical Constraint Networks. The algorithm enforcing VAC is improved by integrating the dynamic arc consistency to exploit its incremental behavior. The dynamic arc consistency also allows to improve VAC when maintained VAC during search by efficiently exploiting the changes caused by branching operations. Operations. Secondly, we are interested in stronger domain-based soft consistencies, inspired from similar consistencies in hard constraint networks (path inverse consistency, restricted or Max-restricted path consistencies). From each of these hard consistencies, many soft variants have been proposed for weighted constraint networks. The new consistencies provide lower bounds stronger than soft arc consistencies by processing triplets of variables connected two-by-two by binary cost functions. We have studied the properties of these new consistencies, implemented and tested them on a variety of problems

Rearranged gene order between pig and human in a QTL region on SSC 7 by Olivier Demeure( )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

Analysis of CATMA transcriptome data identifies hundreds of novel functional genes and improves gene models in the Arabidopsis genome by Sébastien Aubourg( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Introduction to a Benchmark Column in CONSTRAINTS by Claude Le Pape( )

1 edition published in 1998 in English and held by 2 WorldCat member libraries worldwide

Contributions au développement d'outils computationnels de design de protéine : méthodes et algorithmes de comptage avec garantie by Clement Viricel( Book )

2 editions published in 2017 in French and held by 2 WorldCat member libraries worldwide

This thesis is focused on two intrinsically related subjects : the computation of the normalizing constant of a Markov random field and the estimation of the binding affinity of protein-protein interactions. First, to tackle this #P-complete counting problem, we developed Z*, based on the pruning of negligible potential quantities. It has been shown to be more efficient than various state-of-the-art methods on instances derived from protein-protein interaction models. Then, we developed #HBFS, an anytime guaranteed counting algorithm which proved to be even better than its predecessor. Finally, we developed BTDZ, an exact algorithm based on tree decomposition. BTDZ has already proven its efficiency on intances from coiled coil protein interactions. These algorithms all rely on methods stemming from graphical models : local consistencies, variable elimination and tree decomposition. With the help of existing optimization algorithms, Z* and Rosetta energy functions, we developed a package that estimates the binding affinity of a set of mutants in a protein-protein interaction. We statistically analyzed our esti- mation on a database of binding affinities and confronted it with state-of-the-art methods. It appears that our software is qualitatively better than these methods

Détection des duplications en tandem au niveau nucléique à l'aide de la théorie des flots by Eric Audemard( Book )

2 editions published in 2011 in French and held by 2 WorldCat member libraries worldwide

Après un rappel des notions fondamentales de biologie moléculaire et plus particulièrement des duplications en tandem, la thèse présente un panorama des outils existants permettant de détecter des régions homologues à grande échelle, en se focalisant sur les méthodes de chaînage d'ancres. Le document introduit alors un formalisme général de modélisation basé sur les graphes. Une nouvelle méthode de chaînage, capable de produire un ensemble de chaînes de score optimal et satisfaisant des contraintes de cohérences assurant une interprétation aisée des résultats est formulée, en exploitant la théorie des flots de coût minimum. Cette méthode est évaluée sur des problèmes de détection de duplications segmentales chez les plantes puis intégrée dans un pipeline de détection de grande régions dupliquées en tandem directement à partir de la séquence génomique. Cet outil est évalué sur le génome de la plante modèle Arabidopsis thaliana et confronté à l'annotation du génome, montrant ses capacités à détecter des régions dupliquées impliquant des éléments non-codants

JOBIM 2001 : journées ouvertes biologie informatique mathématiques, Toulouse 30 mai - 01 juin by informatique, mathématiques Journées ouvertes Biologie( Book )

2 editions published in 2001 in French and English and held by 2 WorldCat member libraries worldwide

Integrating alternative splicing detection into gene prediction by Sylvain Foissac( )

1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide

High resolution radiation hybrid maps of bovine chromosomes 19 and 29: comparison with the bovine genome sequence assembly by Aparna Prasad( )

1 edition published in 2007 in English and held by 2 WorldCat member libraries worldwide

Multi-language evaluation of exact solvers in graphical model discrete optimization by Barry Hurley( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide

Triangle-based consistencies for cost function networks by Hiep Nguyen( )

1 edition published in 2016 in English and held by 2 WorldCat member libraries worldwide