Search Results - (Author, Cooperation:T. Schiex)

Showing 1 - 5 results of 5, query time: 0.12s Refine Results
  1. 1
    N. D. Young ; F. Debelle ; G. E. Oldroyd ; R. Geurts ; S. B. Cannon ; M. K. Udvardi ; V. A. Benedito ; K. F. Mayer ; J. Gouzy ; H. Schoof ; Y. Van de Peer ; S. Proost ; D. R. Cook ; B. C. Meyers ; M. Spannagl ; F. Cheung ; S. De Mita ; V. Krishnakumar ; H. Gundlach ; S. Zhou ; J. Mudge ; A. K. Bharti ; J. D. Murray ; M. A. Naoumkina ; B. Rosen ; K. A. Silverstein ; H. Tang ; S. Rombauts ; P. X. Zhao ; P. Zhou ; V. Barbe ; P. Bardou ; M. Bechner ; A. Bellec ; A. Berger ; H. Berges ; S. Bidwell ; T. Bisseling ; N. Choisne ; A. Couloux ; R. Denny ; S. Deshpande ; X. Dai ; J. J. Doyle ; A. M. Dudez ; A. D. Farmer ; S. Fouteau ; C. Franken ; C. Gibelin ; J. Gish ; S. Goldstein ; A. J. Gonzalez ; P. J. Green ; A. Hallab ; M. Hartog ; A. Hua ; S. J. Humphray ; D. H. Jeong ; Y. Jing ; A. Jocker ; S. M. Kenton ; D. J. Kim ; K. Klee ; H. Lai ; C. Lang ; S. Lin ; S. L. Macmil ; G. Magdelenat ; L. Matthews ; J. McCorrison ; E. L. Monaghan ; J. H. Mun ; F. Z. Najar ; C. Nicholson ; C. Noirot ; M. O'Bleness ; C. R. Paule ; J. Poulain ; F. Prion ; B. Qin ; C. Qu ; E. F. Retzel ; C. Riddle ; E. Sallet ; S. Samain ; N. Samson ; I. Sanders ; O. Saurat ; C. Scarpelli ; T. Schiex ; B. Segurens ; A. J. Severin ; D. J. Sherrier ; R. Shi ; S. Sims ; S. R. Singer ; S. Sinharoy ; L. Sterck ; A. Viollet ; B. B. Wang ; K. Wang ; M. Wang ; X. Wang ; J. Warfsmann ; J. Weissenbach ; D. D. White ; J. D. White ; G. B. Wiley ; P. Wincker ; Y. Xing ; L. Yang ; Z. Yao ; F. Ying ; J. Zhai ; L. Zhou ; A. Zuber ; J. Denarie ; R. A. Dixon ; G. D. May ; D. C. Schwartz ; J. Rogers ; F. Quetier ; C. D. Town ; B. A. Roe
    Nature Publishing Group (NPG)
    Published 2011
    Staff View
    Publication Date:
    2011-11-18
    Publisher:
    Nature Publishing Group (NPG)
    Print ISSN:
    0028-0836
    Electronic ISSN:
    1476-4687
    Topics:
    Biology
    Chemistry and Pharmacology
    Medicine
    Natural Sciences in General
    Physics
    Keywords:
    *Biological Evolution ; *Genome, Plant ; Medicago truncatula/*genetics/*microbiology ; Molecular Sequence Data ; Nitrogen Fixation/genetics ; Rhizobium/*physiology ; Soybeans/genetics ; *Symbiosis ; Synteny ; Vitis/genetics
    Published by:
    http://www.nature.com/

    Latest Papers from Table of Contents or Articles in Press
  2. 2
    Staff View
    ISSN:
    1476-4687
    Source:
    Nature Archives 1869 - 2009
    Topics:
    Biology
    Chemistry and Pharmacology
    Medicine
    Natural Sciences in General
    Physics
    Notes:
    [Auszug] Ralstonia solanacearum is a devastating, soil-borne plant pathogen with a global distribution and an unusually wide host range. It is a model system for the dissection of molecular determinants governing pathogenicity. We present here the complete genome sequence and its analysis of strain ...
    Type of Medium:
    Electronic Resource
    URL:
    http://dx.doi.org/10.1038/415497a

    Articles: DFG German National Licenses
  3. 3
    Cabon, B. ; de Givry, S. ; Lobjois, L. ; Schiex, T. ; Warners, J.P.
    Springer
    Published 1999
    Staff View
    ISSN:
    1572-9354
    Keywords:
    benchmarks ; radio link frequency assignment ; constraint satisfaction ; optimization
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Notes:
    Abstract The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NP-hard) optimization problem. In 1993, the CELAR (the French “Centre d'Electronique de l'Armement”) built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network Roisnel93. Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications). These problems should look very attractive to the CSP community: the problem is simple to represent, all constraints are binary and involve finite domain variables. They nevertheless have some of the flavors of real problems (including large size and several optimization criteria). This paper gives essential facts about the CELAR instances and also introduces the GRAPH instances which were generated during the CALMA project.
    Type of Medium:
    Electronic Resource
    URL:
    http://dx.doi.org/10.1023/A:1009812409930

    Articles: DFG German National Licenses
  4. 4
    Staff View
    ISSN:
    1572-9354
    Keywords:
    overconstrained problems ; constraint satisfaction ; optimization ; soft constraint ; dynamic programming ; branch and bound ; complexity
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Notes:
    Abstract In this paper we describe and compare two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. While comparing the two approaches, we show how to pass from one to the other one, and we discuss when this is possible. The two frameworks have been independently introduced in ijcai95,jacm and schiex-ijcai95.
    Type of Medium:
    Electronic Resource
    URL:
    http://dx.doi.org/10.1023/A:1026441215081

    Articles: DFG German National Licenses
  5. 5
    Cayrol, C. ; Lagasquie‐Schiex, M.‐C. ; Schiex, T.
    Springer
    Published 1998
    Staff View
    ISSN:
    1573-7470
    Source:
    Springer Online Journal Archives 1860-2000
    Topics:
    Computer Science
    Mathematics
    Notes:
    Abstract The purpose of this paper is to outline various results regarding the computational complexity and the algorithms of nonmonotonic entailment in different coherence‐based approaches. Starting from a (non necessarily consistent) belief base E and a pre‐order on E, we first present different mechanisms for selecting preferred consistent subsets. Then we present different entailment principles in order to manage these multiple subsets. The crossing point of each generation mechanism m and each entailment principle p defines an entailment relation $$ (E, \leqslant )\left| \sim \right.^{p,m} \Phi $$ which we study from the computational complexity point of view. The results are not very encouraging since the complexity of all these nonmonotonic entailment relations is, in most restricted languages, larger than the complexity of monotonic entailment. So, we decided to extend Binary Decision Diagrams technics, which are well suited to the task of solving NP‐hard logic‐based problems. Both theoretical and experimental results are described along this line in the last sections.
    Type of Medium:
    Electronic Resource
    URL:
    http://dx.doi.org/10.1023/A:1018939502485

    Articles: DFG German National Licenses