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
Performance Evaluation of a Parallel Algorithm for Determin..:
, In:
2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)
,
Salhi, Hajer
;
Ben Mabrouk, Bchira
;
Mahjoub, Zaher
- p. 675-681 , 2017
Link:
https://doi.org/10.1109/AICCSA.2017.179
RT T1 <cTitle>2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)</cTitle>: T1 <Title>Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-8308353&Exemplar=1&LAN=DE A1 Salhi, Hajer A1 Ben Mabrouk, Bchira A1 Mahjoub, Zaher YR 2017 SN 2161-5330 K1 Program processors K1 Partitioning algorithms K1 Optimization K1 Heuristic algorithms K1 Signal processing algorithms K1 Strips K1 Fitting K1 1D Array partitioning problem K1 combinatorial optimization K1 loop interchange K1 optimal solution K1 parallelization K1 polyhedral algorithm K1 strip mining SP 675 OP 681 LK http://dx.doi.org/https://doi.org/10.1109/AICCSA.2017.179 DO https://doi.org/10.1109/AICCSA.2017.179 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
