default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Alexander Albrecht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j35]Hua-Ping Liu, Jian V. Zhang, Dongwen Wang, Andreas Alexander Albrecht, Kathleen Steinhöfel
, Hung-Ming Lai:
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)
2010 – 2019
- 2016
- [j34]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) - [j33]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
- [j32]Hung-Ming Lai, Celal Öztürk, Andreas Alexander Albrecht, Kathleen Steinhöfel:
A new vision of evaluating gene expression signatures. Comput. Biol. Chem. 57: 54-60 (2015) - [c36]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
- [j31]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) - [c35]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 - [c34]Hung-Ming Lai, Andreas Alexander Albrecht, Kathleen Steinhöfel:
Robust Signature Discovery for Affymetrix GeneChip® Cancer Classification. ICAART (Revised Selected Papers) 2014: 329-345 - [c33]Valery Katerinchuk, Andreas Alexander Albrecht, Kathleen Steinhöfel:
Energy-efficient Multicast Routing by using Genetic Local Search. ICAART (1) 2014: 740-746 - 2012
- [j30]Sudhakar Sahoo, Andreas Alexander Albrecht:
Approximating the set of local minima in partial RNA folding landscapes. Bioinform. 28(4): 523-530 (2012) - [j29]Abu Zafer M. Dayem Ullah, Sudhakar Sahoo, Kathleen Steinhöfel, Andreas Alexander Albrecht:
Derivative scores from site accessibility and ranking of miRNA target predictions. Int. J. Bioinform. Res. Appl. 8(3/4): 171-191 (2012) - 2010
- [j28]Sudhakar Sahoo, Andreas Alexander Albrecht:
Ranking of microRNA target prediction scores by Pareto front analysis. Comput. Biol. Chem. 34(5-6): 284-292 (2010) - [j27]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. Informaticae 104(3): 201-217 (2010) - [j26]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) - [j25]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)
2000 – 2009
- 2009
- [j24]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. Comput. Biol. Chem. 33(4): 283-294 (2009) - 2008
- [j23]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) - [j22]Mohammed Saeed 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. Comput. Oper. Res. 35(6): 2049-2070 (2008) - [c32]Xiangchao Gan, Leonidas Kapsokalivas, Andreas Alexander Albrecht, Kathleen Steinhöfel:
A Symmetry-Free Subspace for Ab initioProtein Folding Simulations. BIRD 2008: 128-139 - [c31]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 - [c30]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 - [c29]Conrad Attard, Andreas Alexander Albrecht:
The impact of axon wiring costs on small neuronal networks. ESANN 2008: 191-196 - [c28]Conrad Attard, Andreas Alexander Albrecht:
On axon delay functions and spiking activity. IJCNN 2008: 2190-2194 - [c27]Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel:
Estimating the Number of Local Maxima for k-SAT Instances. ISAIM 2008 - 2007
- [j21]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht:
Relating time complexity of protein folding simulation to approximations of folding time. Comput. Phys. Commun. 176(7): 465-470 (2007) - [c26]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht:
Stochastic Protein Folding Simulation in the d-Dimensional HP-Model. BIRD 2007: 381-394 - [c25]Andreas Alexander Albrecht:
Complexity Aspects of Image Classification. MIMI 2007: 1-4 - 2006
- [j20]Andreas Alexander Albrecht:
Stochastic local search for the Feature Set problem, with applications to microarray data. Appl. Math. Comput. 183(2): 1148-1164 (2006) - [j19]Mohammed Saeed Zahrani, Martin J. Loomes, James A. Malcolm, Andreas Alexander Albrecht:
Landscape analysis for multicast routing. Comput. Commun. 30(1): 101-116 (2006) - [j18]Andreas Alexander Albrecht:
A Stopping Criterion for Logarithmic Simulated Annealing. Computing 78(1): 55-79 (2006) - [j17]Georgios Lappas, R. J. Frank, Andreas Alexander Albrecht:
A Computational Study on Circuit Size versus Circuit Depth. Int. J. Artif. Intell. Tools 15(2): 143-162 (2006) - [c24]Mohammed Saeed Zahrani, Martin J. Loomes, James A. Malcolm, Andreas Alexander Albrecht:
Genetic local search for multicast routing. GECCO 2006: 615-616 - [c23]Andreas Alexander Albrecht, Kathleen Steinhöfel:
Run-time Estimates for Protein Folding Simulation in the H-P Model. AI&M 2006 - [c22]Mohammed Saeed Zahrani, James A. Malcolm, Martin J. Loomes, Andreas Alexander Albrecht:
LSA-based Landscape Analysis for Multicast Routing. SGAI Conf. 2006: 187-200 - [c21]Kathleen Steinhöfel, Alexandros Skaliotis, Andreas Alexander Albrecht:
Landscape Analysis for Protein-Folding Simulation in the H-P Model. WABI 2006: 252-261 - 2004
- [j16]Andreas Alexander Albrecht, Chak-Kuen Wong:
Approximation of Boolean Functions by Local Search. Comput. Optim. Appl. 27(1): 53-82 (2004) - [c20]Andreas Alexander Albrecht:
On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains. GECCO (1) 2004: 642-653 - [c19]Andreas Alexander Albrecht:
A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search. ICCSA (3) 2004: 405-414 - 2003
- [j15]Andreas Alexander Albrecht, Staal Amund Vinterbo, Lucila Ohno-Machado:
An Epicurean learning approach to gene-expression data classification. Artif. Intell. Medicine 28(1): 75-87 (2003) - [j14]Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong:
An experimental analysis of local minima to improve neighbourhood search. Comput. Oper. Res. 30(14): 2157-2173 (2003) - [c18]Andreas Alexander Albrecht, Peter Gottschling, Uwe Naumann:
Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently. International Conference on Computational Science 2003: 575-584 - [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
- [j13]Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong:
Bounded-depth threshold circuits for computer-assisted CT image classification. Artif. Intell. Medicine 24(2): 179-192 (2002) - [j12]Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong:
Fast parallel heuristics for the job shop scheduling problem. Comput. Oper. Res. 29(2): 151-169 (2002) - [j11]Andreas Alexander Albrecht, Martin J. Loomes, Kathleen Steinhöfel, Matthias Taupitz:
Adaptive Simulated Annealing for CT Image Classification. Int. J. Pattern Recognit. Artif. Intell. 16(5): 573-588 (2002) - [j10]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) - [c17]Andreas Alexander Albrecht, Staal Amund Vinterbo, C. K. Wong, Lucila Ohno-Machado:
A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data. ICANN 2002: 401-407 - 2001
- [j9]Andreas Alexander Albrecht, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong:
Logarithmic simulated annealing for X-ray diagnosis. Artif. Intell. Medicine 22(3): 249-260 (2001) - [j8]Andreas Alexander Albrecht, S. K. Cheung, Kwong-Sak Leung, Chak-Kuen Wong:
On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects. Comput. Optim. Appl. 19(2): 179-208 (2001) - [j7]Andreas Alexander Albrecht, C. K. Wong:
Combining the Perceptron Algorithm with Logarithmic Simulated Annealing. Neural Process. Lett. 14(1): 75-83 (2001) - [c16]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 - [c15]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 - [c14]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 - [c13]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 - 2000
- [c12]Andreas Alexander Albrecht, Chak-Kuen Wong:
Inhomogeneous Markov Chains Applied to Pattern Classification. AI&M 2000 - [c11]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 - [c10]Andreas Alexander Albrecht, Chak-Kuen Wong:
On Logarithmic Simulated Annealing. IFIP TCS 2000: 301-314 - [c9]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
- [j6]Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong:
Two simulated annealing-based heuristics for the job shop scheduling problem. Eur. J. Oper. Res. 118(3): 524-548 (1999) - [c8]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
- [c7]S. K. Cheung, Kwong-Sak Leung, Andreas Alexander Albrecht, C. K. Wong:
Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach. PPSN 1998: 968-977 - [c6]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 - 1997
- [j5]G. Y. Yan, Andreas Alexander Albrecht, G. H. F. Young, Chak-Kuen Wong:
The Steiner Tree Problem in Orientation Metrics. J. Comput. Syst. Sci. 55(3): 529-546 (1997) - [j4]Andreas Alexander Albrecht, S. K. Cheung, K. C. Hui, Kwong-Sak Leung, C. K. Wong:
Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case. IEEE Trans. Computers 46(8): 890-904 (1997) - [j3]Andreas Alexander Albrecht, S. K. Cheung, K. C. Hui, Kwong-Sak Leung, C. K. Wong:
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case. IEEE Trans. Computers 46(8): 905-929 (1997) - [c5]S. K. Cheung, Kwong-Sak Leung, Andreas Alexander Albrecht, C. K. Wong:
Optimal Placements of Flexible Objects: An Evolutionary Programming Approach. ICGA 1997: 583-590 - 1995
- [c4]Andreas Alexander Albrecht:
On threshold circuit depth. ESANN 1995 - [c3]Andreas Alexander Albrecht:
On Lower Bounds for the Depth of Threshold Circuits with Weights from {-1, 0, +1}. GOSLER Final Report 1995: 404-416
1980 – 1989
- 1988
- [c2]Andreas Alexander Albrecht:
On simulaneous realizations of Boolean functions, with applications. Parcella 1988: 51-56 - 1987
- [e1]Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269, Springer 1987, ISBN 3-540-18099-0 [contents] - 1986
- [c1]Andreas Alexander Albrecht:
On Hardware Algorithms for Geometrical Computation Problems. IFIP Congress 1986: 989-994 - 1980
- [j2]Andreas Alexander Albrecht:
F-V-Schemata mit verzögernden Funktionalelementen. J. Inf. Process. Cybern. 16(7): 335-344 (1980)
1970 – 1979
- 1979
- [j1]Andreas Alexander Albrecht:
Zur Kompliziertheit der Realisierung Boolescher Funktionen durch F-V-Schemata. J. Inf. Process. Cybern. 15(3): 159-171 (1979)
Coauthor Index
aka: C. K. Wong
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-04-25 05:46 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:
