I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Universal-stability results and performance bounds for gree..:
Andrews, Matthew
;
Awerbuch, Baruch
;
Fernández, Antonio
...
Journal of the ACM (JACM). 48 (2001) 1 - p. 39-69 , 2001
Link:
https://dl.acm.org/doi/10.1145/363647.363677
RT Journal T1
Universal-stability results and performance bounds for greedy contention-resolution protocols
UL https://suche.suub.uni-bremen.de/peid=acm-363677&Exemplar=1&LAN=DE A1 Andrews, Matthew A1 Awerbuch, Baruch A1 Fernández, Antonio A1 Leighton, Tom A1 Liu, Zhiyong A1 Kleinberg, Jon PB ACM YR 2001 SN 0004-5411 SN 1557-735X K1 adversarial queuing theory K1 end-to-end delay K1 network stability K1 packet scheduling K1 Networks K1 Network types K1 Packet-switching networks K1 Theory of computation K1 Theory and algorithms for application domains K1 Machine learning theory K1 Reinforcement learning K1 Sequential decision making K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Scheduling algorithms K1 Online algorithms K1 Online learning algorithms JF Journal of the ACM (JACM) VO 48 IS 1 SP 39 OP 69 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/363647.363677 DO https://dl.acm.org/doi/10.1145/363647.363677 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)