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
A Simulated Annealing Algorithm for Maximum Common Edge Sub..:
, In:
Proceedings of the Genetic and Evolutionary Computation Conference 2016
,
Larsen, Simon J.
;
Alkærsig, Frederik G.
;
Ditzel, Henrik J.
... - p. 341-348 , 2016
Link:
https://dl.acm.org/doi/10.1145/2908812.2908858
RT T1
Proceedings of the Genetic and Evolutionary Computation Conference 2016
: T1
A Simulated Annealing Algorithm for Maximum Common Edge Subgraph Detection in Biological Networks
UL https://suche.suub.uni-bremen.de/peid=acm-2908858&Exemplar=1&LAN=DE A1 Larsen, Simon J. A1 Alkærsig, Frederik G. A1 Ditzel, Henrik J. A1 Jurisica, Igor A1 Alcaraz, Nicolas A1 Baumbach, Jan PB ACM YR 2016 K1 ILS K1 MCES K1 ant colony optimization K1 local search K1 maximum common subgraph K1 multiple network alignment K1 network alignment K1 simulated annealing K1 Networks K1 Network algorithms K1 Theory of computation K1 Design and analysis of algorithms K1 Mathematical optimization K1 Discrete optimization K1 Optimization with randomized search heuristics K1 Simulated annealing K1 Randomized local search K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Computing methodologies K1 Parallel computing methodologies K1 Parallel algorithms K1 Shared memory algorithms SP 341 OP 348 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2908812.2908858 DO https://dl.acm.org/doi/10.1145/2908812.2908858 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)