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
Comparison between graph-based and interference-based STDMA..:
, In:
Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
,
Grönkvist, Jimmi
;
Hansson, Anders
- p. 255-258 , 2001
Link:
https://dl.acm.org/doi/10.1145/501449.501453
RT T1 <cTitle>Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing</cTitle>: T1 <Title>Comparison between graph-based and interference-based STDMA scheduling</Title> UL https://suche.suub.uni-bremen.de/peid=acm-501453&Exemplar=1&LAN=DE A1 Grönkvist, Jimmi A1 Hansson, Anders PB ACM YR 2001 K1 Networks K1 Network types K1 Wireless access networks K1 Mobile networks K1 Theory of computation K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Scheduling algorithms K1 Online algorithms K1 Online learning algorithms K1 Theory and algorithms for application domains K1 Machine learning theory K1 Reinforcement learning K1 Sequential decision making K1 Graph algorithms analysis K1 Network flows K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory SP 255 OP 258 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/501449.501453 DO https://dl.acm.org/doi/10.1145/501449.501453 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
