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
Wireless coverage prediction via parametric shortest paths:
, In:
Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing
,
Applegate, David
;
Archer, Aaron
;
Johnson, David S.
... - p. 221-230 , 2018
Link:
https://dl.acm.org/doi/10.1145/3209582.3209605
RT T1 <cTitle>Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing</cTitle>: T1 <Title>Wireless coverage prediction via parametric shortest paths</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3209605&Exemplar=1&LAN=DE A1 Applegate, David A1 Archer, Aaron A1 Johnson, David S. A1 Nikolova, Evdokia A1 Thorup, Mikkel A1 Yang, Ger PB ACM YR 2018 K1 dominant path model K1 parametric shortest paths K1 wireless coverage prediction K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Paths and connectivity problems K1 Networks K1 Network algorithms K1 Control path algorithms K1 Network design and planning algorithms K1 Network types K1 Wireless access networks K1 Wireless local area networks K1 Approximation algorithms SP 221 OP 230 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3209582.3209605 DO https://dl.acm.org/doi/10.1145/3209582.3209605 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
