Остановите войну!
for scientists:
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 38 matches
- 2005
- Eleftheria Athanasopoulou, Purvesh Thakker, William H. Sanders:
Evaluating the Dependability of a LEO Satellite Network for Scientific Applications. QEST 2005: 95-104 - Souheib Baarir, Claude Dutheillet, Serge Haddad, Jean-Michel Ilié:
On the use of exact lumpability in partially symmetricalWell-formed Nets. QEST 2005: 23-32 - Eitan Bachmat:
On the performance of D-redundant disk systems. QEST 2005: 105-113 - Peter Bazan, Reinhard German:
Approximate Analysis of Stochastic Models by Self-Correcting Aggregation. QEST 2005: 134-144 - Alexandre Bouchard-Côté, Norm Ferns, Prakash Panangaden, Doina Precup:
An approximation algorithm for labelled Markov processes: towards realistic approximation. QEST 2005: 54-62 - Giacomo Bucci, R. Piovosi, Luigi Sassoli, Enrico Vicario:
Introducing Probability within State Class Analysis of Dense-Time-Dependent Systems. QEST 2005: 13-22 - Alix L. H. Chow, Leana Golubchik, John C. S. Lui:
Toward Picture-perfect Streaming on the Internet. QEST 2005: 63-73 - Lucia Cloth, Boudewijn R. Haverkort:
Model Checking for Survivability. QEST 2005: 145-154 - Tod Courtney, Salem Derisavi, Shravan Gaonkar, Mark Griffith, Vinh Vi Lam, Michael G. McQuinn, Eric Rozier, William H. Sanders:
The Mobius Modeling Environment: Recent Extensions - 2005. QEST 2005: 259-260 - Michele Curti, Davide Prandi, Linda Brodo:
Formal Executable Descriptions of Biological Systems. QEST 2005: 2-12 - Matthew Curtis-Maury, Tanping Wang:
Integrating Multiple Forms of Multithreaded Execution on multi-SMT Systems: A Study with Scientific Applications. QEST 2005: 199-209 - Lorenzo Falai, Andrea Bondavalli, Felicita Di Giandomenico:
NekoStat extension to Neko: Quantitative Evaluation of Distributed Algorithms. QEST 2005: 241-242 - Elena Gómez-Martínez, José Merseguer:
A Software Performance Engineering Tool based on the UML-SPT. QEST 2005: 247-248 - S. Govind, R. Govindarajan:
Performance Modeling and Architecture Exploration of Network Processors. QEST 2005: 189-198 - Marco Gribaudo, Francesco Moscato, Nicola Mazzocca, Valeria Vittorini:
Multisolution of Complex Performability Models in the OsMoSys/DrawNET Framework. QEST 2005: 85-94 - Marco Gribaudo, Daniele Codetta Raiteri, Giuliana Franceschinis:
Draw-Net, a customizable multi-formalism, multi-solution tool for the quantitative evaluation of systems. QEST 2005: 257-258 - Jane Hillston:
Fluid Flow Approximation of PEPA models. QEST 2005: 33-43 - András Horváth:
Steady State Solution for Models with Geometric and Finite Support Activity Duration. QEST 2005: 114-123 - Gábor Horváth, Miklós Telek, Peter Buchholz:
A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation. QEST 2005: 124-133 - Benny Van Houdt, Chris Blondia:
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures. QEST 2005: 210-219 - Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapreev:
A Markov Reward Model Checker. QEST 2005: 243-244 - YoungMin Kwon, Gul A. Agha:
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs. QEST 2005: 245-246 - Marisa Llorens, Javier Oliver:
MCReNet: a tool for Marked-Controlled Reconfigurable Nets. QEST 2005: 255-256 - Victor F. Nicola, Tatiana S. Zaburnenko:
Importance Sampling Simulation of Population Overflow in Two-node Tandem Networks. QEST 2005: 220-229 - G. Rajeshwari, Santonu Sarkar:
SAM: A Tool for Software Architecture Modeling and Performance Analysis. QEST 2005: 249-250 - Werner Sandmann:
On Optimal Importance Sampling for Discrete Time Markov Chains. QEST 2005: 230-240 - Roberto Segala, Andrea Turrini:
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models. QEST 2005: 44-53 - Koushik Sen, Mahesh Viswanathan, Gul A. Agha:
VESTA: A Statistical Model-checker and Analyzer for Probabilistic Systems. QEST 2005: 251-252 - Thomas L. Sterling:
Challenges to Evaluating Petaflops Systems. QEST 2005: 166-167 - Max Walter, Carsten Trinitis:
OpenSESAME Simple but Extensive Structured Availability Modeling Environment. QEST 2005: 253-254
skipping 8 more matches
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-05-29 18:59 CEST 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