William E. Hart

Orcid: 0000-0002-6849-2780

According to our database1, William E. Hart authored at least 50 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shortest path network interdiction with asymmetric uncertainty.
Networks, April, 2024

Accelerating x-ray tracing for exascale systems using Kokkos.
Concurr. Comput. Pract. Exp., 2024

2023
Linear model decision trees as surrogates in optimization of engineering applications.
Comput. Chem. Eng., October, 2023

2022
A survey of software implementations used by application codes in the Exascale Computing Project.
Int. J. High Perform. Comput. Appl., 2022

2021
Performance Portability in the Exascale Computing Project: Exploration Through a Panel Series.
Comput. Sci. Eng., 2021

2015
PEBBL: an object-oriented framework for scalable parallel branch and bound.
Math. Program. Comput., 2015

2012
PySP: modeling and solving stochastic programs in Python.
Math. Program. Comput., 2012

Real-time inversion in large-scale water networks using discrete measurements.
Comput. Chem. Eng., 2012

2011
Pyomo: modeling and solving mathematical programs in Python.
Math. Program. Comput., 2011

2009
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.
Interfaces, 2009

2007
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

EXACT: the experimental algorithmics computational toolkit.
Proceedings of the Workshop on Experimental Computer Science, 2007

2006
Robust optimization of contaminant sensor placement for community water systems.
Math. Program., 2006

Massively Parallel Mixed-Integer Programming: Algorithms and Applications.
Proceedings of the Parallel Processing for Scientific Computing, 2006

2005
Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains.
Soft Comput., 2005

Discrete sensor placement problems in distribution networks.
Math. Comput. Model., 2005

A Filter-Based Evolutionary Algorithm for Constrained Optimization.
Evol. Comput., 2005

2004
Opportunities for Combinatorial Optimization in Computational Biology.
INFORMS J. Comput., 2004

Editorial Introduction Special Issue on Memetic Algorithms.
Evol. Comput., 2004

Spares Optimization for the Lockheed Martin Joint Strike Fighter.
Proceedings of the 36th conference on Winter simulation, 2004

Convergence Examples of a Filter-Based Evolutionary Algorithm.
Proceedings of the Genetic and Evolutionary Computation, 2004

2003
Locally-Adaptive and Memetic Evolutionary Pattern Search Algorithms.
Evol. Comput., 2003

2002
On The Convergence Properties Of A Simple Self-adaptive Evolutionary Algorithm.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

Alignment Of Protein Structures With A Memetic Evolutionary Algorithm.
Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

2001
Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization.
IEEE Trans. Evol. Comput., 2001

A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search.
Evol. Comput., 2001

2000
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms.
J. Univers. Comput. Sci., 2000

1999
Measurement and classification of retinal vascular tortuosity.
Int. J. Medical Informatics, 1999

On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids.
Algorithmica, 1999

Comparing Evolutionary Programs and Evolutionary Pattern Search Algorithms: A Drug Docking Application.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

A performance analysis of evolutionary pattern search with generalized mutation steps.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search.
SIAM J. Optim., 1998

Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function.
J. Comput. Chem., 1998

On the Application of Evolutionary Pattern Search Algorithms.
Proceedings of the Evolutionary Programming VII, 7th International Conference, 1998

1997
Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials.
J. Comput. Biol., 1997

Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal.
J. Comput. Biol., 1997

Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

On the computational complexity of sequence design problems.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

A Comparison of Global and Local Search Methods in Drug Docking.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

A Generalized Stationary Point Convergence Theory for Evolutionary Algorithms.
Proceedings of the 7th International Conference on Genetic Algorithms, 1997

Automated measurement of retinal vascular tortuosity.
Proceedings of the AMIA 1997, 1997

1996
Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal.
J. Comput. Biol., 1996

Analysis of the Numerical Effects of Parallelism on a Parallel Genetic Algorithm.
Proceedings of IPPS '96, 1996

A Stationary Point Convergence Theory for Evolutionary Algorithms.
Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, 1996

A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing.
Proceedings of the Fifth Annual Conference on Evolutionary Programming, 1996

Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Registering Retinal Images Using Automatically Selected Control Point Pairs.
Proceedings of the Proceedings 1994 International Conference on Image Processing, 1994

The Role of Development in Genetic Algorithms.
Proceedings of the Third Workshop on Foundations of Genetic Algorithms. Estes Park, Colorado, USA, July 31, 1994

1991
Optimising an Arbitrary Function is Hard for the Genetic Algorithm.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991


  Loading...