Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Crossover can provably be useful in evolutionary computation
Authors: Doerr, Benjamin; Happ, Edda; Klein, Christian
Date of Publication (YYYY-MM-DD): 2012
Title of Journal: Theoretical Computer Science
Volume: 425
Start Page: 17
End Page: 33
Document Type: Article
ID: 536779.0
Toward a complexity theory for randomized search heuristics : black box models
Authors: Winzen, Carola
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Date of Approval (YYYY-MM-DD): 2011-12-16
Document Type: PhD-Thesis
ID: 618740.0
Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Authors: Busch, Philip Johannes
Type of Thesis (e.g.Diploma): bachelor
Date of Approval (YYYY-MM-DD): 2011-11-14
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Document Type: Thesis
ID: 618741.0
Evolutionary algorithms to compute lower bounds for the star discrepancy
Authors: Ingalalli, Vijay
Type of Thesis (e.g.Diploma): master
Date of Approval (YYYY-MM-DD): 2011-10-28
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Document Type: Thesis
ID: 618739.0
Implementation of Schmidt's algorithm for certifying triconnectivity testing
Authors: Neumann, Adrian
Type of Thesis (e.g.Diploma): master
Date of Approval (YYYY-MM-DD): 2011-03-23
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Document Type: Thesis
ID: 618738.0
Certified numerical root finding
Authors: Kobel, Alexander
Type of Thesis (e.g.Diploma): master
Date of Approval (YYYY-MM-DD): 2011-02-14
Name of University: Universität des Saarlandes
Place of University: Saarbrücken
Document Type: Thesis
ID: 618719.0
Decision Support and Optimization in Shutdown and Turnaround Scheduling
Authors: Megow, Nicole; Möhring, Rolf H.; Schulz, Jens
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: INFORMS Journal on Computing
Volume: 23
Issue / Number: 2
Start Page: 189
End Page: 204
Document Type: Article
ID: 536735.0
New Plain-Exponential Time Classes for Graph Homomorphism
Authors: Wahlström, Magnus
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Theory of Computing Systems
Volume: 49
Issue / Number: 2
Start Page: 273
End Page: 282
Document Type: Article
ID: 536778.0
On the online unit clustering problem
Authors: Epstein, Leah; van Stee, Rob
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: ACM Transactions on Algorithms
Volume: 7
Issue / Number: 1
Start Page: 7:1
End Page: 7:1
Sequence Number of Article: 7
Document Type: Article
ID: 536715.0
Runtime analysis of the 1-ANT ant colony optimizer
Authors: Doerr, Benjamin; Neumann, Frank; Sudholt, Dirk; Witt, Carsten
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: Theoretical Computer Science
Volume: 412
Issue / Number: 17
Start Page: 1629–
End Page: 1644
Document Type: Article
ID: 536795.0
Entries: 1-10  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.