Остановите войну!
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 10 matches
- 2016
- Michael Köhler-Bußmeier, Frank Heitmann:
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets. Fundam. Informaticae 143(1-2): 89-100 (2016) - Mahmoud El Chamie, Yue Yu, Behçet Açikmese:
Convex synthesis of randomized policies for controlled Markov chains with density safety upper bound constraints. ACC 2016: 6290-6295 - 2014
- Michael Köhler-Bußmeier, Frank Heitmann:
An Upper Bound for the Reachability Problem of Safe, Elementary Hornets. CS&P 2014: 101-112 - 2010
- Shun-Pin Hsu:
Control of continuous-time Markov chains with safety upper bounds. CASE 2010: 990-993 - 2008
- Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. CP 2008: 598-602 - Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher:
Revisiting the upper bounding process in a safe Branch and Bound algorithm. CoRR abs/0807.2382 (2008) - 2005
- Monica Kristiansen:
Finding Upper Bounds for Software Failure Probabilities - Experiments and Results. SAFECOMP 2005: 179-193 - 2003
- Aristotle Arapostathis, Ratnesh Kumar, Sekhar Tangirala:
Controlled Markov chains with safety upper bound. IEEE Trans. Autom. Control. 48(7): 1230-1234 (2003) - Francesco Basile, Ciro Carbone, Pasquale Chiacchio:
A reachable throughput upper bound for live and safe free choice nets via T-invariants. ECC 2003: 624-629 - 2002
- Stéphane Louise:
Calcul de majorants sûrs de temps d'exécution au pire pour des tâches d'applications temps-réels critiques, pour des systèmes disposants de caches mémoire. (Calculation of Worst Case Execution Time safe upper bounds for hard real-time tasks, for systems using cache memories). University of Paris-Sud, Orsay, France, 2002
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-04-23 14:10 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