Kathleen Steinhöfel

Orcid: 0000-0002-9533-4649

According to our database1, Kathleen Steinhöfel authored at least 61 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
New Bounds for Time-Dependent Scheduling with Uniform Deterioration.
CoRR, 2023

2022
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, 2022

2021
A Machine Learning Model for Predicting Fetal Hemoglobin Levels in Sickle Cell Disease Patients.
Proceedings of Sixth International Congress on Information and Communication Technology, 2021

2018
Firefly-Inspired Algorithm for Job Shop Scheduling.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Multi-Agent Flag Coordination Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
A new heuristic method for approximating the number of local minima in partial RNA energy landscapes.
Comput. Biol. Chem., 2016

Random versus Deterministic Descent in RNA Energy Landscape Analysis.
Adv. Bioinformatics, 2016

2015
A new vision of evaluating gene expression signatures.
Comput. Biol. Chem., 2015

MicroRNA Target Prediction Based Upon Metastable RNA Secondary Structures.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

On Energy-Efficient Computations With Advice.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Accessibility of microRNA binding sites in metastable RNA secondary structures in the presence of SNPs.
Bioinform., 2014

Robust Signature Discovery for Affymetrix GeneChip® Cancer Classification.
Proceedings of the Agents and Artificial Intelligence - 6th International Conference, 2014

A Framework for High-throughput Gene Signatures with Microarray-based Brain Cancer Gene Expression Profiling Data.
Proceedings of the ICAART 2014, 2014

Energy-efficient Multicast Routing by using Genetic Local Search.
Proceedings of the ICAART 2014, 2014

2013
Sa based power efficient FPGA LUT mapping.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

2012
Derivative scores from site accessibility and ranking of miRNA target predictions.
Int. J. Bioinform. Res. Appl., 2012

2011
A Memetic Approach to Protein Structure Prediction in Triangular Lattices.
Proceedings of the Neural Information Processing - 18th International Conference, 2011

2010
Analysis of Local Search Landscapes for <i>k</i>-SAT Instances.
Math. Comput. Sci., 2010

Uphill unfolding of native protein conformations in cubic lattices.
J. Comput. Sci., 2010

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification.
RAIRO Theor. Informatics Appl., 2010

A Note on a priori Estimations of Classification Circuit Complexity.
Fundam. Informaticae, 2010

A hybrid approach to protein folding problem integrating constraint programming with local search.
BMC Bioinform., 2010

A Replica Exchange Monte Carlo Algorithm for the Optimization of Secondary Structure Packing in Proteins.
Proceedings of the Evolutionary Computation, 2010

2009
Constraint-based Local Move Definitions for Lattice Protein Models Including Side Chains
CoRR, 2009

Population-based local search for protein folding simulation in the MJ energy model and cubic lattices.
Comput. Biol. Chem., 2009

2008
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing.
Comput. Oper. Res., 2008

Stochastic protein folding simulation in the three-dimensional HP-model.
Comput. Biol. Chem., 2008

A Local Move Set for Protein Folding in Triangular Lattice Models.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Estimating the Number of Local Maxima for k-SAT Instances.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Combinatorial landscape analysis for k-SAT instances.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

Two Local Search Methods for Protein Folding Simulation in the HP and the MJ Lattice Models.
Proceedings of the Bioinformatics Research and Development, 2008

A Symmetry-Free Subspace for Ab initioProtein Folding Simulations.
Proceedings of the Bioinformatics Research and Development, 2008

2007
Relating time complexity of protein folding simulation to approximations of folding time.
Comput. Phys. Commun., 2007

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Algorithmic Oper. Res., 2007

Efficient Algorithms for the Spoonerism Problem.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Stochastic Protein Folding Simulation in the d-Dimensional HP-Model.
Proceedings of the Bioinformatics Research and Development, First International Conference, 2007

2006
Landscape Analysis for Protein-Folding Simulation in the H-P Model.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Run-time Estimates for Protein Folding Simulation in the H-P Model.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

Search Based Approaches to Component Selection and Prioritization for the Next Release Problem.
Proceedings of the 22nd IEEE International Conference on Software Maintenance (ICSM 2006), 2006

Search--based approaches to the component selection and prioritization problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2003
An experimental analysis of local minima to improve neighbourhood search.
Comput. Oper. Res., 2003

2002
The convergence of stochastic algorithms solving flow shop scheduling.
Theor. Comput. Sci., 2002

Adaptive Simulated Annealing for CT Image Classification.
Int. J. Pattern Recognit. Artif. Intell., 2002

Fast parallel heuristics for the job shop scheduling problem.
Comput. Oper. Res., 2002

Bounded-depth threshold circuits for computer-assisted CT image classification.
Artif. Intell. Medicine, 2002

Server Placements, Roman Domination and other Dominating Set Variants.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Classification of JPEG2000 compressed CT images.
Proceedings of the 14th International Conference on Digital Signal Processing, 2002

2001
Logarithmic simulated annealing for X-ray diagnosis.
Artif. Intell. Medicine, 2001

On the Complexity of Train Assignment Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

A local search method for pattern classification.
Proceedings of the 9th European Symposium on Artificial Neural Networks, 2001

Liver tissue classification by bounded-depth threshold circuits.
Proceedings of the CARS 2001. Computer Assisted Radiology and Surgery. Proceedings of the 15th International Congress and Exhibition, 2001

CT-Image Classification by Threshold Circuits.
Proceedings of the Bildverarbeitung für die Medizin 2001: Algorithmen, 2001

Depth-Four Threshold Circuits for Computer-Assisted X-ray Diagnosis.
Proceedings of the Artificial Intelligence Medicine, 2001

2000
Distributed Simulated Annealing for Job Shop Scheduling.
Proceedings of the Parallel Problem Solving from Nature, 2000

A Parallel Implementation of a Job Shop Scheduling Heuristic.
Proceedings of the Applied Parallel Computing, 2000

Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Two simulated annealing-based heuristics for the job shop scheduling problem.
Eur. J. Oper. Res., 1999

A Simulated Annealing-Based Learning Algorithm for Boolean DNF.
Proceedings of the Advanced Topics in Artificial Intelligence, 1999

Stochastic algorithms in scheduling theory.
PhD thesis, 1999

1998
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998


  Loading...