default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2016
- Cheng Feng, Jane Hillston, Daniël Reijsbergen:
Moment-Based Probabilistic Prediction of Bike Availability for Bike-Sharing Systems. QEST 2016: 139-155 - Elvio Gilberto Amparore, Susanna Donatelli:
Optimal Aggregation of Components for the Solution of Markov Regenerative Processes. QEST 2016: 19-34 - Simonetta Balsamo, Andrea Marin, Ivan Stojic:
Spnps: A Tool for Perfect Sampling in Stochastic Petri Nets. QEST 2016: 163-166 - Benoît Barbot, Nicolas Basset, Marc Beunardeau, Marta Kwiatkowska:
Uniform Sampling for Timed Automata with Application to Language Inclusion Measurement. QEST 2016: 175-190 - Ezio Bartocci, Luca Bortolussi, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti:
Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent. QEST 2016: 244-259 - Steffen Bondorf, Jens B. Schmitt:
Should Network Calculus Relocate? An Assessment of Current Algebraic and Optimization-Based Analyses. QEST 2016: 207-223 - Luca Bortolussi, Luca Cardelli, Marta Kwiatkowska, Luca Laurenti:
Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation. QEST 2016: 72-88 - Peter Buchholz, Tugrul Dayar, Jan Kriege, M. Can Orhan:
Compact Representation of Solution Vectors in Kronecker-Based Markovian Analysis. QEST 2016: 260-276 - Javier Esparza, Philipp Hoffmann, Ratul Saha:
Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets. QEST 2016: 89-104 - Olga Gadyatskaya, Ravi Jhawar, Piotr Kordy, Karim Lounis, Sjouke Mauw, Rolando Trujillo-Rasua:
Attack Trees for Practical Security Assessment: Ranking of Attack Scenarios with ADTool 2.0. QEST 2016: 159-162 - Misikir Eyob Gebrehiwot, Samuli Aalto, Pasi E. Lassila:
Energy-Aware Server with SRPT Scheduling: Analysis and Optimization. QEST 2016: 107-122 - Stefan Haar, Simon Theissing:
Decoupling Passenger Flows for Improved Load Prediction. QEST 2016: 364-379 - Sofie Haesaert, Alessandro Abate, Paul M. J. Van den Hof:
Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement. QEST 2016: 227-243 - Ernst Moritz Hahn, Vahid Hashemi, Holger Hermanns, Andrea Turrini:
Exploiting Robust Optimization for Interval Probabilistic Bisimulation. QEST 2016: 55-71 - Jane Hillston, Michele Loreti:
CARMA Eclipse Plug-in: A Tool Supporting Design and Analysis of Collective Adaptive Systems. QEST 2016: 167-171 - Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Inferring Covariances for Probabilistic Programs. QEST 2016: 191-206 - Jan Kriege, Peter Buchholz:
Traffic Modeling with Phase-Type Distributions and VARMA Processes. QEST 2016: 295-310 - Andrea Marin, Sabina Rossi:
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations. QEST 2016: 123-138 - Michalis Michaelides, Dimitrios Milios, Jane Hillston, Guido Sanguinetti:
Property-Driven State-Space Coarsening for Continuous Time Markov Chains. QEST 2016: 3-18 - Giovanni Neglia, Sara Alouf, Abdulhalim Dandoush, Sébastien Simoens, Pierre Dersin, Alina Tuholukova, Jérôme Billion, Pascal Derouet:
Performance Evaluation of Train Moving-Block Control. QEST 2016: 348-363 - Elizabeth Polgreen, Viraj B. Wijesuriya, Sofie Haesaert, Alessandro Abate:
Data-Efficient Bayesian Verification of Parametric Markov Chains. QEST 2016: 35-51 - Michael J. Rausch, Brett Feddersen, Ken Keefe, William H. Sanders:
A Comparison of Different Intrusion Detection Approaches in an Advanced Metering Infrastructure Network Using ADVISE. QEST 2016: 279-294 - Enno Ruijters, Dennis Guck, Peter Drolenga, Margot Peters, Mariëlle Stoelinga:
Maintenance Analysis and Optimization via Statistical Model Checking - Evaluating a Train Pneumatic Compressor. QEST 2016: 331-347 - Huaming Wu, William J. Knottenbelt, Katinka Wolter, Yi Sun:
An Optimal Offloading Partitioning Algorithm in Mobile Cloud Computing. QEST 2016: 311-328 - Gul Agha, Benny Van Houdt:
Quantitative Evaluation of Systems - 13th International Conference, QEST 2016, Quebec City, QC, Canada, August 23-25, 2016, Proceedings. Lecture Notes in Computer Science 9826, Springer 2016, ISBN 978-3-319-43424-7 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-02 03:58 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint