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
Efficient Removal of Points with Smallest Crowding Distance..:
, In:
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion
,
Nigmatullin, Niyaz
;
Buzdalov, Maxim
;
Stankevich, Andrey
- p. 1121-1128 , 2016
Link:
https://dl.acm.org/doi/10.1145/2908961.2931685
RT T1 <cTitle>Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion</cTitle>: T1 <Title>Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2931685&Exemplar=1&LAN=DE A1 Nigmatullin, Niyaz A1 Buzdalov, Maxim A1 Stankevich, Andrey PB ACM YR 2016 K1 crowding distance K1 multi-objective optimization K1 non-dominated sorting K1 performance evaluation K1 steady-state algorithms. K1 Theory of computation K1 Design and analysis of algorithms K1 Data structures design and analysis K1 Sorting and searching SP 1121 OP 1128 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2908961.2931685 DO https://dl.acm.org/doi/10.1145/2908961.2931685 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
