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

Index « Titre (en) » - entrée « path »
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.
paternal < path < pathogen  Facettes :

List of bibliographic references indexed by path

Number of relevant bibliographic references: 52.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
000564 (2015-04-27) Sacha Varone [Suisse] ; Kamel Aissat [France]Multi-modal transportation with public transport and ride-sharing - multi-modal transportation using a path-based method.
000668 (2015-01) Thibault Maillot [France] ; Ugo Boscain [France] ; Jean-Paul Gauthier [France] ; Ulysse Serres [France]Lyapunov and Minimum-Time Path Planning for Drones
000707 (2015) René Schott [France] ; G. Stacey Staples [États-Unis]Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems
001156 (2013-06-19) Rémi Bonidal [France]Model selection using regularization path for quadratic cost support vector machines
001753 (2013) Rémi Bonidal [France] ; Samy Tindel [France] ; Yann Guermeur [France]Model Selection for the l2-SVM by Following the Regularization Path
001A49 (2012-07) Liliana Cucu-Grosjean [France] ; Luca Santinelli [France] ; Michael Houston [Royaume-Uni] ; Codé Lo [France] ; Tullio Vardanega [Italie] ; Leonidas Kosmidis [Espagne] ; Jaume Abella [Espagne] ; Enrico Mezzeti [Italie] ; Eduardo Quinones [Espagne] ; Francisco J. Cazorla [Espagne]Measurement-Based Probabilistic Timing Analysis for Multi-path Programs
002654 (2011) Nicolas Normand [France, Australie] ; Robin Strand [Suède] ; Pierre Evenou [France] ; Aurore Arlicot [France]Path-Based Distance with Varying Weights and Neighborhood Sequences
003030 (2010) Michael Codish [Israël] ; Jürgen Giesl [Allemagne] ; Peter Schneider-Kamp [Danemark] ; René Thiemann [Autriche]SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
003A20 (2009) Naohi Eguchi [Japon]A lexicographic path order with slow growing derivation bounds
003E48 (2008-09-15) Frédéric Blanqui [République populaire de Chine] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]The computability path ordering: the end of a quest
004013 (2008-05-12) Drago Matko ; Gregor Klancar ; Saso Blazic ; Olivier Simonin [France] ; Franck Gechter ; Jean-Michel Contet [France] ; Pablo GruerThe Application of Reference-path Control to Vehicle Platoons
004297 (2008) Frédéric Blanqui [France] ; Jean-Pierre Jouannaud [France] ; Albert Rubio [Espagne]The Computability Path Ordering: The End of a Quest
004B95 (2007) Peter Schneider-Kamp [Allemagne] ; René Thiemann [Allemagne] ; Elena Annov [Israël] ; Michael Codish [Israël] ; Jürgen Giesl [Allemagne]Proving Termination Using Recursive Path Orders and SAT Solving
004E55 (2007) Ustun Yildiz [France]On Dead Path Elimination in Decentralized Process Executions
005064 (2006-07-12) Tchimou N'Takpé [France] ; Frédéric Suter [France]Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms
005531 (2006) Solange Coupet-Grimal [France] ; William Delobel [France]An effective proof of the well-foundedness of the multiset path ordering
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
006929 (2004) Bruno Gaujal ; Nicolas Navet ; Cormac WalshShortest Path Algorithms for Real-Time Scheduling of FIFO tasks with Minimal Energy Use
007798 (2003) Bruno Gaujal ; Nicolas Navet ; Jörn MiggeDual-Priority versus Background Scheduling : a Path-wise Comparison
007A71 (2003) Bruno Gaujal [France] ; Nicolas Navet [France] ; Jorn Migge [France]Dual-Priority versus Background Scheduling: A Path-Wise Comparison
008844 (2002) -D. Boissonnat ; Ghosh [États-Unis] ; Kavitha [États-Unis] ; LazardAn Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

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 "path" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "path" \
         | 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é=    path
}}

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