Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Titre (en) » - entrée « minimal »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
minima < minimal < minimales  Facettes :

List of bibliographic references indexed by minimal

Number of relevant bibliographic references: 44.
[0-20] [0 - 20][0 - 44][20-40]
Ident.Authors (with country if any)Title
000072 (2016-02-01) Jean-Guillaume Dumas [France] ; Erich Kaltofen [États-Unis] ; Emmanuel Thomé [France] ; Gilles Villard [France]Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
000455 (2015-07-03) Jean-Guillaume Dumas [France] ; Erich Kaltofen [États-Unis] ; Emmanuel Thomé [France]Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices
001615 (2013) Fabio Papacchini [Royaume-Uni] ; Renate A. Schmidt [Royaume-Uni]Computing Minimal Models Modulo Subset-Simulation for Modal Logics
001714 (2013) Nicolas Normand [France] ; Robin Strand [Suède] ; Pierre Evenou [France] ; Aurore Arlicot [France]Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D
001824 (2012-12-03) Hugo Cruz-Sanchez [France] ; Stacey Staples [États-Unis] ; René Schott [France] ; Ye-Qiong Song [France]Operator Calculus Approach to Minimal Paths: Precomputed routing in a Store and Forward Satellite Constellation
001840 (2012-11-28) Octave Boussaton [France] ; Johanne Cohen [France] ; Joanna Tomasik [France] ; Dominique Barth [France]On the distributed learning of Nash equilibria with minimal information
001E44 (2012) Kosuke Izumi [États-Unis] ; Laura K. Conlin [États-Unis] ; Donna Berrodin [États-Unis] ; Christopher Fincher [États-Unis] ; Alisha Wilkens [États-Unis] ; Chad Haldeman-Englert [États-Unis] ; Sulagna C. Saitta [États-Unis] ; Elaine H. Zackai [États-Unis] ; Nancy B. Spinner [États-Unis] ; Ian D. Krantz [États-Unis]Duplication 12p and Pallister–Killian syndrome: A case report and review of the literature toward defining a Pallister–Killian syndrome minimal critical region
001F32 (2012) Laszlo Szathmary [Hongrie] ; Petko Valtchev [Canada] ; Amedeo Napoli [France] ; Robert Godin [Canada]Finding minimal rare itemsets in a depth-first manner
001F37 (2012) Laszlo Szathmary [Hongrie] ; Petko Valtchev [Canada] ; Amedeo Napoli [France] ; Robert Godin [Canada]Efficient Vertical Mining of Minimal Rare Itemsets
002648 (2011) Imants Svalbe [Australie] ; Nicolas Normand [Australie, France]Properties of Minimal Ghosts
002E91 (2010) Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France]Generating Rare Association Rules Using the Minimal Rare Itemsets Family
003079 (2010) Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France]Finding Minimal Rare Itemsets and Rare Association Rules
003242 (2010) A. Zavada ; C. L. Buckley ; Dominique Martinez [France] ; Jean-Pierre Rospars [France] ; T. NowotnyMinimal model of blend recognition in the moth pheromone system
003247 (2010) Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France]Finding Minimal Rare Itemsets and Rare Association Rules
003B75 (2009) Damien Jamet [France] ; Jean-Luc Toutant [France]Minimal arithmetic thickness connecting discrete planes
004028 (2008-04-26) Xavier Goaoc [France] ; Kim Hyo-Sil [Corée du Sud] ; Lim Jung-Gun [Corée du Sud]There are arbitrary large minimal 2-pinning configurations
005147 (2006-04-26) Freddy Deppner [France] ; Marie-Claude Portmann [France]A hybrid decomposition approach using increasing clusters for solving scheduling problems with minimal and maximal time lags
005592 (2006) Julien Fondrevelle [France] ; Ammar Oulamara [France] ; Marie-Claude Portmann [France]Permutation flowshop scheduling problems with maximal and minimal time lags
005C28 (2005) Bruno Gaujal [France] ; Nicolas Navet [France] ; Cormac Walsh [France]Shortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use
006220 (2005) René Schott [France] ; Jean-Claude Spehner [France]On the Minimal Automaton of the Shuffle of Words and Araucarias
006605 (2004-09) René Schott [France] ; Jean-Claude Spehner [France]On the Minimal Automaton of the Shuffle of Words and Araucarias

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "minimal" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "minimal" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    minimal
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022