![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Marie-Ange Remiche
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j11]Tony Leclercq, Ebrahim Khalil Abbasi, Bruno Dumas, Marie-Ange Remiche, Patrick Heymans:
Essential Expectations of Users of Web Configurators: An Empirical Survey. Proc. ACM Hum. Comput. Interact. 6(EICS): 165:1-165:26 (2022) - 2017
- [j10]Eleonora Deiana, Guy Latouche, Marie-Ange Remiche:
Fluid flow model for energy-aware server performance evaluation. SIGMETRICS Perform. Evaluation Rev. 45(3): 204-209 (2017) - 2012
- [j9]Sarah Dendievel, Guy Latouche, Marie-Ange Remiche:
Stationary distribution of a perturbed QBD process. SIGMETRICS Perform. Evaluation Rev. 39(4): 40 (2012) - [j8]Maria Govorun, Guy Latouche, Marie-Ange Remiche:
Profits and risks of pension plans. SIGMETRICS Perform. Evaluation Rev. 39(4): 41 (2012) - 2010
- [j7]Miguel de Vega Rodrigo, Guy Latouche, Marie-Ange Remiche:
Blocking probability computation in reversible Markovian bufferless multi-server systems. Perform. Evaluation 67(3): 121-140 (2010) - 2009
- [j6]Miguel de Vega Rodrigo, Guy Latouche, Marie-Ange Remiche:
Modeling bufferless packet-switching networks with packet dependencies. Comput. Networks 53(9): 1450-1466 (2009) - 2007
- [j5]Miguel de Vega Rodrigo, Marie-Ange Remiche:
Planning OBS networks with QoS constraints. Photonic Netw. Commun. 14(2): 229-239 (2007) - [j4]Tobias Hoßfeld, Kenji Leibnitz, Marie-Ange Remiche:
Modeling of an online TV recording service. SIGMETRICS Perform. Evaluation Rev. 35(2): 15-17 (2007) - 2006
- [j3]Sophie Hautphenne
, Kenji Leibnitz, Marie-Ange Remiche:
Extinction probability in peer-to-peer file diffusion. SIGMETRICS Perform. Evaluation Rev. 34(2): 3-4 (2006) - 2005
- [j2]Tessa Dzial, Lothar Breuer, Ana da Silva Soares, Guy Latouche, Marie-Ange Remiche:
Fluid queues to solve jump processes. Perform. Evaluation 62(1-4): 132-146 (2005) - 2002
- [j1]Guy Latouche, Marie-Ange Remiche:
An MAP-based Poisson cluster model for Web traffic. Perform. Evaluation 49(1/4): 359-370 (2002)
Conference and Workshop Papers
- 2023
- [c10]Eleonora Deiana
, Guy Latouche, Marie-Ange Remiche
:
Sojourn Time in a Markov Driven Fluid Queue with Finite Buffer. EPEW 2023: 96-110 - 2019
- [c9]Eleonora Deiana
, Guy Latouche, Marie-Ange Remiche:
Sojourn Time Distribution in Fluid Queues. QTNA 2019: 295-313 - 2017
- [c8]Laurent Schumacher
, Marie-Ange Remiche:
Sensitivity to web hosting in a mobile field survey. PerCom Workshops 2017: 316-320 - [c7]Laurent Schumacher
, Marie-Ange Remiche:
Sensitivity to RAN in a Mobile Field Survey. VTC Spring 2017: 1-5 - 2016
- [c6]Ferdinand Peper, Kenji Leibnitz, Tetsuya Shimokawa, Marie-Ange Remiche:
Average consensus in asymmetric broadcasting wireless sensor networks through gossiping. MobiQuitous (Adjunct Proceedings) 2016: 171-176 - 2011
- [c5]Maxime Cordy, Marie-Ange Remiche:
QBD sensitivity analysis tool using discrete-event simulation and extension of SMCSolver. VALUETOOLS 2011: 439-446 - 2010
- [c4]Kenji Leibnitz, Marie-Ange Remiche:
Modeling the Extinction in the Information Diffusion Process in Wireless Sensor Networks. ICCCN 2010: 1-5 - 2009
- [c3]Sophie Hautphenne, Guy Latouche, Marie-Ange Remiche:
Transient features for Markovian binary trees. VALUETOOLS 2009: 18 - 2008
- [c2]Tobias Hoßfeld
, Kenji Leibnitz, Marie-Ange Remiche:
Exact Sojourn Time Distribution in an Online IPTV Recording System. ASMTA 2008: 158-172 - 2001
- [c1]Rudolf Mathar, Marie-Ange Remiche:
The impact of different services on the outage probability in UMTS. VTC Fall 2001: 934-937
Editorship
- 2008
- [e1]Dario Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
Numerical Methods for Structured Markov Chains, 11.11. - 14.11.2007. Dagstuhl Seminar Proceedings 07461, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents]
Informal and Other Publications
- 2007
- [i3]Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
07461 Executive Summary -- Numerical Methods for Structured Markov Chains. Numerical Methods for Structured Markov Chains 2007 - [i2]Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ramaswami, Marie-Ange Remiche, Peter G. Taylor:
07461 Abstracts Collection -- Numerical Methods for Structured Markov Chains. Numerical Methods for Structured Markov Chains 2007 - [i1]Sophie Hautphenne, Guy Latouche, Marie-Ange Remiche:
Matrix Analytic Methods in Branching processes. Numerical Methods for Structured Markov Chains 2007
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint