( en | de | ru )

 

Disambiguation of "Durand, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
A Perfect Sampling Algorithm of Random Walks with Forbidden Arcs.

, , , and . QEST, volume 8657 of Lecture Notes in Computer Science, page 178-193. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Klein

Stéphane Müller

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

Other publications of authors with the same name

Optimal Targeting in Super-Modular Games., , and . IEEE Trans. Autom. Control., 67 (12): 6366-6380 (2022)Controlling network coordination games., , and . CoRR, (2019)Représentation des connaissances dans un système d'information., , , and . JFIADSMA, page 193-205. Hermès Lavoisier Editions, (1999)General revision protocols in best response algorithms for potential games., , , and . NetGCooP, page 239-246. IEEE, (2014)Spatio-Temporal Mask Learning: Application to Speech Recognition., and . ICANNGA, page 132-135. Springer, (1995)Perfect sampling of Jackson queueing networks., , , and . Queueing Syst. Theory Appl., 80 (3): 223-260 (2015)TOM, une architecture connexionniste de traitement de séquences: eapplication à la reconnaissance de la parole. (TOM, a connectionist architecture for sequence processing: application to speech recognition).. Henri Poincaré University, Nancy, France, (1995)Optimal Intervention in Non-Binary Super-Modular Games., , , and . IEEE Control. Syst. Lett., (2023)Analysis of Best Response Dynamics in Potential Games. (Analyse de la meilleure dynamique de réponse dans les jeux potentiels).. Grenoble Alpes University, France, (2018)Complexity and Optimality of the Best Response Algorithm in Random Potential Games., and . SAGT, volume 9928 of Lecture Notes in Computer Science, page 40-51. Springer, (2016)