Andreas Alexander Albrecht

According to our database1, Andreas Alexander Albrecht authored at least 71 papers between 1979 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

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

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

Approximating the set of local minima in partial RNA folding landscapes.
Bioinform., 2012

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

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

Ranking of microRNA target prediction scores by Pareto front analysis.
Comput. Biol. Chem., 2010

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

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

On axon delay functions and spiking activity.
Proceedings of the International Joint Conference on Neural Networks, 2008

The impact of axon wiring costs on small neuronal networks.
Proceedings of the 16th European Symposium on Artificial Neural Networks, 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

Complexity Aspects of Image Classification.
Proceedings of the Medical Imaging and Informatics, 2nd 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
A Computational Study on Circuit Size versus Circuit Depth.
Int. J. Artif. Intell. Tools, 2006

A Stopping Criterion for Logarithmic Simulated Annealing.
Computing, 2006

Landscape analysis for multicast routing.
Comput. Commun., 2006

Stochastic local search for the Feature Set problem, with applications to microarray data.
Appl. Math. Comput., 2006

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

LSA-based Landscape Analysis for Multicast Routing.
Proceedings of the Research and Development in Intelligent Systems XXIII, 2006

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

Genetic local search for multicast routing.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2004
Approximation of Boolean Functions by Local Search.
Comput. Optim. Appl., 2004

A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search.
Proceedings of the Computational Science and Its Applications, 2004

On the Complexity to Approach Optimum Solutions by Inhomogeneous Markov Chains.
Proceedings of the Genetic and Evolutionary Computation, 2004

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

An Epicurean learning approach to gene-expression data classification.
Artif. Intell. Medicine, 2003

Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently.
Proceedings of the Computational Science - ICCS 2003, 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

A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data.
Proceedings of the Artificial Neural Networks, 2002

2001
Combining the Perceptron Algorithm with Logarithmic Simulated Annealing.
Neural Process. Lett., 2001

On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects.
Comput. Optim. Appl., 2001

Logarithmic simulated annealing for X-ray diagnosis.
Artif. Intell. Medicine, 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

On Logarithmic Simulated Annealing.
Proceedings of the Theoretical Computer Science, 2000

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

Inhomogeneous Markov Chains Applied to Pattern Classification.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 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

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

Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case.
IEEE Trans. Computers, 1997

Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case.
IEEE Trans. Computers, 1997

The Steiner Tree Problem in Orientation Metrics.
J. Comput. Syst. Sci., 1997

Optimal Placements of Flexible Objects: An Evolutionary Programming Approach.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

1995
On Lower Bounds for the Depth of Threshold Circuits with Weights from {-1, 0, +1}.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

On threshold circuit depth.
Proceedings of the 3rd European Symposium on Artificial Neural Networks, 1995

1988
On simulaneous realizations of Boolean functions, with applications.
Proceedings of the Parcella '88, 1988

1986
On Hardware Algorithms for Geometrical Computation Problems.
Proceedings of the Information Processing 86, 1986

1980
F-V-Schemata mit verzögernden Funktionalelementen.
J. Inf. Process. Cybern., 1980

1979
Zur Kompliziertheit der Realisierung Boolescher Funktionen durch F-V-Schemata.
J. Inf. Process. Cybern., 1979


  Loading...