Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kathleen Steinhöfel
2010 – today
- 2013
[c26]Richard Dobson, Kathleen Steinhöfel: Sa based power efficient FPGA LUT mapping. GECCO (Companion) 2013: 1545-1552- 2012
- [j18]Abu Zafer M. Dayem Ullah, Sudhakar Sahoo, Kathleen Steinhöfel, Andreas Alexander Albrecht: Derivative scores from site accessibility and ranking of miRNA target predictions. IJBRA 8(3/4): 171-191 (2012)
- 2011
- [c25]Md. Kamrul Islam, Madhu Chetty, Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel: 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 Bioinformatics 11(S-1): 39 (2010)
- [j16]Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel: A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Inform. 104(3): 201-217 (2010)
- [j15]Hans-Joachim Böckenhauer, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová: The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. RAIRO - Theor. Inf. and Applic. 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. Science 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. Mathematics in Computer Science 3(4): 465-488 (2010)
- [c24]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, Andreas Alexander Albrecht, Kathleen Steinhöfel: Population-based local search for protein folding simulation in the MJ energy model and cubic lattices. Computational Biology and Chemistry 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. Computational Biology and Chemistry 32(4): 248-255 (2008)
- [j10]Mohammed S. Zahrani, Martin J. Loomes, James A. Malcolm, Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel, Andreas Alexander Albrecht: Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing. Computers & OR 35(6): 2049-2070 (2008)
- [c23]Xiangchao Gan, Leonidas Kapsokalivas, Andreas Alexander Albrecht, Kathleen Steinhöfel: A Symmetry-Free Subspace for Ab initioProtein Folding Simulations. BIRD 2008: 128-139
- [c22]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
- [c21]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
- [c20]Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel: Estimating the Number of Local Maxima for k-SAT Instances. ISAIM 2008
- [c19]Hans-Joachim Böckenhauer, Abu Zafer M. Dayem Ullah, Leonidas Kapsokalivas, Kathleen Steinhöfel: 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 Operations Research 2(1) (2007)
- [j8]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht: Relating time complexity of protein folding simulation to approximations of folding time. Computer Physics Communications 176(7): 465-470 (2007)
- [c18]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht: Stochastic Protein Folding Simulation in the d-Dimensional HP-Model. BIRD 2007: 381-394
- [c17]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel: Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92
- 2006
- [c16]Mark Harman, Alexandros Skaliotis, Kathleen Steinhöfel, Paul Baker: Search--based approaches to the component selection and prioritization problem. GECCO 2006: 1951-1952
- [c15]Paul Baker, Mark Harman, Kathleen Steinhöfel, Alexandros Skaliotis: Search Based Approaches to Component Selection and Prioritization for the Next Release Problem. ICSM 2006: 176-185
- [c14]Andreas Alexander Albrecht, Kathleen Steinhöfel: Run-time Estimates for Protein Folding Simulation in the H-P Model. ISAIM 2006
- [c13]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 (Eds.): 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
- 2003
- [j7]Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong: An experimental analysis of local minima to improve neighbourhood search. Computers & OR 30(14): 2157-2173 (2003)
- [e2]Andreas Alexander Albrecht, Kathleen Steinhöfel (Eds.): 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
- 2002
- [j6]Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong: Bounded-depth threshold circuits for computer-assisted CT image classification. Artificial Intelligence in Medicine 24(2): 179-192 (2002)
- [j5]Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong: Fast parallel heuristics for the job shop scheduling problem. Computers & OR 29(2): 151-169 (2002)
- [j4]Andreas Alexander Albrecht, Martin J. Loomes, Kathleen Steinhöfel, Matthias Taupitz: Adaptive Simulated Annealing for CT Image Classification. IJPRAI 16(5): 573-588 (2002)
- [j3]Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong: The convergence of stochastic algorithms solving flow shop scheduling. Theor. Comput. Sci. 285(1): 101-117 (2002)
- [c12]Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291
- 2001
- [j2]Andreas Alexander Albrecht, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong: Logarithmic simulated annealing for X-ray diagnosis. Artificial Intelligence in 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, Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
- [c6]Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402
- [e1]Kathleen Steinhöfel (Ed.): 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
- 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]
- [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. DISKI 218, Infix 1999, ISBN 978-3-89601-218-0, pp. I-X, 1-134
- [j1]Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong: Two simulated annealing-based heuristics for the job shop scheduling problem. European Journal of Operational Research 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, Andreas Alexander Albrecht, C. K. Wong: On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. RANDOM 1998: 260-279
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:23 CEST by the dblp team