Остановите войну!
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 17 matches
- 2006
- Eitan Altman, Konstantin Avrachenkov, Urtzi Ayesta:
A survey on discriminatory processor sharing. Queueing Syst. Theory Appl. 53(1-2): 53-63 (2006) - Thomas Bonald, Laurent Massoulié, Alexandre Proutière, Jorma T. Virtamo:
A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. Theory Appl. 53(1-2): 65-84 (2006) - Sem C. Borst, Rudesindo Núñez-Queija:
Introduction to special issue on queueing models for fair resource sharing. Queueing Syst. Theory Appl. 53(1-2): 5-6 (2006) - Sem C. Borst, Rudesindo Núñez-Queija, Bert Zwart:
Sojourn time asymptotics in processor-sharing queues. Queueing Syst. Theory Appl. 53(1-2): 31-51 (2006) - Sing-Kong Cheung, Hans van den Berg, Richard J. Boucherie:
Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue. Queueing Syst. Theory Appl. 53(1-2): 7-18 (2006) - A. B. Dieker, Marc Lelarge:
Tails for (max, plus) recursions under subexponentiality. Queueing Syst. Theory Appl. 53(4): 213-230 (2006) - Douglas G. Down, Rong Wu:
Multi-layered round robin routing for parallel servers. Queueing Syst. Theory Appl. 53(4): 177-188 (2006) - Robert C. Hampshire, Mor Harchol-Balter, William A. Massey:
Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. Queueing Syst. Theory Appl. 53(1-2): 19-30 (2006) - Peter B. Key, Laurent Massoulié:
Fluid models of integrated traffic and multipath routing. Queueing Syst. Theory Appl. 53(1-2): 85-98 (2006) - Arzad Alam Kherani:
A direct approach to sojourn times in a busy period of an M/M/1 queue. Queueing Syst. Theory Appl. 53(3): 159-169 (2006) - A. Novak, Peter G. Taylor, Darryl Veitch:
The distribution of the number of arrivals in a subinterval of a busy period of a single server queue. Queueing Syst. Theory Appl. 53(3): 105-114 (2006) - Toshihisa Ozawa:
Sojourn time distributions in the queue defined by a general QBD process. Queueing Syst. Theory Appl. 53(4): 203-211 (2006) - Yutaka Sakuma, Masakiyo Miyazawa, Yiqiang Q. Zhao:
Decay rate for a PH/M/2 queue with shortest queue discipline. Queueing Syst. Theory Appl. 53(4): 189-201 (2006) - Anand D. Sarwate, Venkat Anantharam:
Exact emulation of a priority queue with a switch and delay lines. Queueing Syst. Theory Appl. 53(3): 115-125 (2006) - Yang Shin:
Monotonicity properties in various retrial queues and their applications. Queueing Syst. Theory Appl. 53(3): 147-157 (2006) - Joris Walraevens, Dieter Fiems, Herwig Bruneel:
The discrete-time preemptive repeat identical priority queue. Queueing Syst. Theory Appl. 53(4): 231-243 (2006) - Ji-An Zhao, Bo Li, Xi-Ren Cao, Ishfaq Ahmad:
A matrix-analytic solution for the DBMAP/PH/1 priority queue. Queueing Syst. Theory Appl. 53(3): 127-145 (2006)
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-08-24 08:18 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