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
Solving combinatorial optimization problems using relaxed l..:
, In:
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
,
Jin, Chen
;
Fu, Qiang
;
Wang, Huahua
... - p. 39-46 , 2013
Link:
https://dl.acm.org/doi/10.1145/2501221.2501227
RT T1
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
: T1
Solving combinatorial optimization problems using relaxed linear programming : a high performance computing perspective
UL https://suche.suub.uni-bremen.de/peid=acm-2501227&Exemplar=1&LAN=DE A1 Jin, Chen A1 Fu, Qiang A1 Wang, Huahua A1 Agrawal, Ankit A1 Hendrix, William A1 Liao, Wei-keng A1 Patwary, Md. Mostofa Ali A1 Banerjee, Arindam A1 Choudhary, Alok PB ACM YR 2013 K1 Markov random field K1 alternating direction method of multipliers K1 maximum a posteriori inference K1 message passing interface SP 39 OP 46 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2501221.2501227 DO https://dl.acm.org/doi/10.1145/2501221.2501227 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)