default search action
Kathleen Steinhöfel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik
, Kathleen Steinhöfel:
New bounds for single-machine time-dependent scheduling with uniform deterioration. Theor. Comput. Sci. 1006: 114673 (2024) - 2023
- [i2]Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik, Kathleen Steinhöfel:
New Bounds for Time-Dependent Scheduling with Uniform Deterioration. CoRR abs/2307.00627 (2023) - 2022
- [j23]Hua-Ping Liu, Jian V. Zhang, Dongwen Wang, Andreas Alexander Albrecht, Kathleen Steinhöfel
Extended endocrine therapy in breast cancer: A basket of length-constraint feature selection metaheuristics to balance Type I against Type II errors. J. Biomed. Informatics 131: 104112 (2022) - 2021
- [c35]Konstantinos Oikonomou
A Machine Learning Model for Predicting Fetal Hemoglobin Levels in Sickle Cell Disease Patients. ICICT (1) 2021: 79-91
2010 – 2019
- 2018
- [c34]Joss Miller-Todd, Kathleen Steinhöfel
Firefly-Inspired Algorithm for Job Shop Scheduling. Adventures Between Lower Bounds and Higher Altitudes 2018: 423-433 - 2017
- [c33]David Kohan Marzagão, Nicolas Rivera, Colin Cooper, Peter McBurney, Kathleen Steinhöfel:
Multi-Agent Flag Coordination Games. AAMAS 2017: 1442-1450 - 2016
- [j22]Luke Day, Ouala Abdelhadi Ep Souki, Andreas Alexander Albrecht, Kathleen Steinhöfel
Random versus Deterministic Descent in RNA Energy Landscape Analysis. Adv. Bioinformatics 2016: 9654921:1-9654921:10 (2016) - [j21]Andreas Alexander Albrecht, Luke Day, Ouala Abdelhadi Ep Souki, Kathleen Steinhöfel
A new heuristic method for approximating the number of local minima in partial RNA energy landscapes. Comput. Biol. Chem. 60: 43-52 (2016) - 2015
- [j20]Hung-Ming Lai, Celal Öztürk
A new vision of evaluating gene expression signatures. Comput. Biol. Chem. 57: 54-60 (2015) - [c32]Hans-Joachim Böckenhauer
On Energy-Efficient Computations With Advice. COCOON 2015: 747-758 - [c31]Ouala Abdelhadi Ep Souki, Luke Day, Andreas Alexander Albrecht, Kathleen Steinhöfel
MicroRNA Target Prediction Based Upon Metastable RNA Secondary Structures. IWBBIO (2) 2015: 456-467 - 2014
- [j19]Luke Day, Ouala Abdelhadi Ep Souki, Andreas Alexander Albrecht, Kathleen Steinhöfel
Accessibility of microRNA binding sites in metastable RNA secondary structures in the presence of SNPs. Bioinform. 30(3): 343-352 (2014) - [c30]Hung-Ming Lai, Andreas Alexander Albrecht, Kathleen Steinhöfel:
A Framework for High-throughput Gene Signatures with Microarray-based Brain Cancer Gene Expression Profiling Data. ICAART (1) 2014: 211-220 - [c29]Hung-Ming Lai, Andreas Alexander Albrecht, Kathleen Steinhöfel
Robust Signature Discovery for Affymetrix GeneChip® Cancer Classification. ICAART (Revised Selected Papers) 2014: 329-345 - [c28]Valery Katerinchuk, Andreas Alexander Albrecht, Kathleen Steinhöfel:
Energy-efficient Multicast Routing by using Genetic Local Search. ICAART (1) 2014: 740-746 - 2013
- [c27]Richard J. B. Dobson
Sa based power efficient FPGA LUT mapping. GECCO (Companion) 2013: 1545-1552 - 2012
- [j18]Abu Zafer M. Dayem Ullah, Sudhakar Sahoo, Kathleen Steinhöfel
Derivative scores from site accessibility and ranking of miRNA target predictions. Int. J. Bioinform. Res. Appl. 8(3/4): 171-191 (2012) - 2011
- [c26]Md. Kamrul Islam, Madhu Chetty
A Memetic Approach to Protein Structure Prediction in Triangular Lattices. ICONIP (1) 2011: 625-635 - 2010
- [j17]Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
A hybrid approach to protein folding problem integrating constraint programming with local search. BMC Bioinform. 11(S-1): 39 (2010) - [j16]Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas
A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Informaticae 104(3): 201-217 (2010) - [j15]Hans-Joachim Böckenhauer
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. RAIRO Theor. Informatics Appl. 44(3): 363-377 (2010) - [j14]Andreas Alexander Albrecht, Leonidas Kapsokalivas, Kathleen Steinhöfel
Uphill unfolding of native protein conformations in cubic lattices. J. Comput. Sci. 1(1): 6-12 (2010) - [j13]Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel
Analysis of Local Search Landscapes for k-SAT Instances. Math. Comput. Sci. 3(4): 465-488 (2010) - [c25]Leonidas Kapsokalivas, Kathleen Steinhöfel:
A Replica Exchange Monte Carlo Algorithm for the Optimization of Secondary Structure Packing in Proteins. EvoBIO 2010: 146-157
2000 – 2009
- 2009
- [j12]Leonidas Kapsokalivas, Xiangchao Gan
Population-based local search for protein folding simulation in the MJ energy model and cubic lattices. Comput. Biol. Chem. 33(4): 283-294 (2009) - [i1]Martin Mann, Mohamed Abou Hamra, Kathleen Steinhöfel, Rolf Backofen:
Constraint-based Local Move Definitions for Lattice Protein Models Including Side Chains. CoRR abs/0910.3880 (2009) - 2008
- [j11]Andreas Alexander Albrecht, Alexandros Skaliotis, Kathleen Steinhöfel
Stochastic protein folding simulation in the three-dimensional HP-model. Comput. Biol. Chem. 32(4): 248-255 (2008) - [j10]Mohammed Saeed Zahrani, Martin J. Loomes
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing. Comput. Oper. Res. 35(6): 2049-2070 (2008) - [c24]Xiangchao Gan, Leonidas Kapsokalivas, Andreas Alexander Albrecht, Kathleen Steinhöfel:
A Symmetry-Free Subspace for Ab initioProtein Folding Simulations. BIRD 2008: 128-139 - [c23]Leonidas Kapsokalivas, Xiangchao Gan, Andreas Alexander Albrecht, Kathleen Steinhöfel:
Two Local Search Methods for Protein Folding Simulation in the HP and the MJ Lattice Models. BIRD 2008: 167-179 - [c22]Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel
Combinatorial landscape analysis for k-SAT instances. IEEE Congress on Evolutionary Computation 2008: 2498-2504 - [c21]Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel:
Estimating the Number of Local Maxima for k-SAT Instances. ISAIM 2008 - [c20]Hans-Joachim Böckenhauer
A Local Move Set for Protein Folding in Triangular Lattice Models. WABI 2008: 369-381 - 2007
- [j9]Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2(1) (2007) - [j8]Kathleen Steinhöfel
Relating time complexity of protein folding simulation to approximations of folding time. Comput. Phys. Commun. 176(7): 465-470 (2007) - [c19]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht:
Stochastic Protein Folding Simulation in the d-Dimensional HP-Model. BIRD 2007: 381-394 - [c18]Hans-Joachim Böckenhauer
Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92 - 2006
- [c17]Mark Harman, Alexandros Skaliotis, Kathleen Steinhöfel, Paul Baker:
Search--based approaches to the component selection and prioritization problem. GECCO 2006: 1951-1952 - [c16]Paul Baker, Mark Harman
Search Based Approaches to Component Selection and Prioritization for the Next Release Problem. ICSM 2006: 176-185 - [c15]Andreas Alexander Albrecht, Kathleen Steinhöfel:
Run-time Estimates for Protein Folding Simulation in the H-P Model. AI&M 2006 - [c14]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht:
Landscape Analysis for Protein-Folding Simulation in the H-P Model. WABI 2006: 252-261 - 2005
- [e3]Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel:
Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings. Lecture Notes in Computer Science 3777, Springer 2005, ISBN 3-540-29498-8 [contents] - 2003
- [j7]Kathleen Steinhöfel
An experimental analysis of local minima to improve neighbourhood search. Comput. Oper. Res. 30(14): 2157-2173 (2003) - [e2]Andreas Alexander Albrecht, Kathleen Steinhöfel
Stochastic Algorithms: Foundations and Applications, Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings. Lecture Notes in Computer Science 2827, Springer 2003, ISBN 3-540-20103-3 [contents] - 2002
- [j6]Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel
Bounded-depth threshold circuits for computer-assisted CT image classification. Artif. Intell. Medicine 24(2): 179-192 (2002) - [j5]Kathleen Steinhöfel
Fast parallel heuristics for the job shop scheduling problem. Comput. Oper. Res. 29(2): 151-169 (2002) - [j4]Andreas Alexander Albrecht, Martin J. Loomes
Adaptive Simulated Annealing for CT Image Classification. Int. J. Pattern Recognit. Artif. Intell. 16(5): 573-588 (2002) - [j3]Kathleen Steinhöfel
The convergence of stochastic algorithms solving flow shop scheduling. Theor. Comput. Sci. 285(1): 101-117 (2002) - [c13]Kathleen Steinhöfel
Classification of JPEG2000 compressed CT images. DSP 2002: 381-385 - [c12]Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor
Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291 - 2001
- [j2]Andreas Alexander Albrecht, Kathleen Steinhöfel
Logarithmic simulated annealing for X-ray diagnosis. Artif. Intell. Medicine 22(3): 249-260 (2001) - [c11]Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong:
Depth-Four Threshold Circuits for Computer-Assisted X-ray Diagnosis. AIME 2001: 369-373 - [c10]Andreas Alexander Albrecht, Eike Hein, Daniela Melzer, Kathleen Steinhöfel, Matthias Taupitz:
CT-Image Classification by Threshold Circuits. Bildverarbeitung für die Medizin 2001: 362-366 - [c9]Andreas Alexander Albrecht, Eike Hein, Daniela Melzer, Kathleen Steinhöfel, Matthias Taupitz, Chak-Kuen Wong:
Liver tissue classification by bounded-depth threshold circuits. CARS 2001: 1156-1157 - [c8]Andreas Alexander Albrecht, Martin J. Loomes, Kathleen Steinhöfel, Matthias Taupitz, Chak-Kuen Wong:
A local search method for pattern classification. ESANN 2001: 1-6 - [c7]Juraj Hromkovic, Kathleen Steinhöfel
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106 - [c6]Thomas Erlebach
On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 - [e1]Kathleen Steinhöfel:
Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings. Lecture Notes in Computer Science 2264, Springer 2001, ISBN 3-540-43025-3 [contents] - 2000
- [c5]Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong:
Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems. CIAC 2000: 277-290 - [c4]Uwe Der, Kathleen Steinhöfel:
A Parallel Implementation of a Job Shop Scheduling Heuristic. PARA 2000: 215-222 - [c3]Andreas Alexander Albrecht, Uwe Der, Kathleen Steinhöfel, Chak-Kuen Wong:
Distributed Simulated Annealing for Job Shop Scheduling. PPSN 2000: 243-252
1990 – 1999
- 1999
- [b1]Kathleen Steinhöfel:
Stochastic algorithms in scheduling theory. Technical University of Berlin, Germany, DISKI 218, Infix 1999, ISBN 978-3-89601-218-0, pp. I-X, 1-134 - [j1]Kathleen Steinhöfel
Two simulated annealing-based heuristics for the job shop scheduling problem. Eur. J. Oper. Res. 118(3): 524-548 (1999) - [c2]Andreas Alexander Albrecht, Kathleen Steinhöfel
A Simulated Annealing-Based Learning Algorithm for Boolean DNF. Australian Joint Conference on Artificial Intelligence 1999: 193-204 - 1998
- [c1]Kathleen Steinhöfel
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. RANDOM 1998: 260-279
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: