default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam E. Hart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Felix Wittwer
, Nicholas K. Sauter, Derek Mendez, Billy K. Poon, Aaron S. Brewster, James M. Holton, Michael E. Wall, William E. Hart, Deborah Bard, Johannes P. Blaschke:
Accelerating x-ray tracing for exascale systems using Kokkos. Concurr. Comput. Pract. Exp. 36(5) (2024)- [j26]She'ifa Z. Punla-Green, John E. Mitchell, Jared L. Gearhart, William E. Hart, Cynthia A. Phillips:
Shortest path network interdiction with asymmetric uncertainty. Networks 83(3): 605-623 (2024) - 2023
- [j25]Bashar L. Ammari, Emma S. Johnson, Georgia Stinchfield, Taehun Kim, Michael Bynum, William E. Hart, Joshua Pulsipher, Carl D. Laird:
Linear model decision trees as surrogates in optimization of engineering applications. Comput. Chem. Eng. 178: 108347 (2023) - 2022
- [j24]Thomas M. Evans, Andrew R. Siegel, Erik W. Draeger, Jack Deslippe, Marianne M. Francois, Timothy C. Germann, William E. Hart, Daniel F. Martin:
A survey of software implementations used by application codes in the Exascale Computing Project. Int. J. High Perform. Comput. Appl. 36(1): 5-12 (2022) - [i1]Felix Wittwer, Nicholas K. Sauter, Derek Mendez, Billy K. Poon, Aaron S. Brewster, James M. Holton, Michael E. Wall, William E. Hart, Deborah Bard, Johannes P. Blaschke:
Accelerating X-Ray Tracing for Exascale Systems using Kokkos. CoRR abs/2205.07976 (2022) - 2021
- [j23]Anshu Dubey, Lois Curfman McInnes, Rajeev Thakur, Erik W. Draeger, Thomas M. Evans, Timothy C. Germann, William E. Hart:
Performance Portability in the Exascale Computing Project: Exploration Through a Panel Series. Comput. Sci. Eng. 23(5): 46-54 (2021)
2010 – 2019
- 2015
- [j22]Jonathan Eckstein, William E. Hart, Cynthia A. Phillips:
PEBBL: an object-oriented framework for scalable parallel branch and bound. Math. Program. Comput. 7(4): 429-469 (2015) - 2012
- [j21]Angelica V. Mann, Sean A. McKenna, William E. Hart, Carl D. Laird:
Real-time inversion in large-scale water networks using discrete measurements. Comput. Chem. Eng. 37: 143-151 (2012) - [j20]Jean-Paul Watson, David L. Woodruff, William E. Hart:
PySP: modeling and solving stochastic programs in Python. Math. Program. Comput. 4(2): 109-149 (2012) - 2011
- [j19]William E. Hart, Jean-Paul Watson, David L. Woodruff:
Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3(3): 219-260 (2011)
2000 – 2009
- 2009
- [j18]Regan Murray, William E. Hart, Cynthia A. Phillips, Jonathan W. Berry, Erik G. Boman, Robert D. Carr, Lee Ann Riesen, Jean-Paul Watson, Terra Haxton, Jonathan G. Herrmann, Robert Janke, George Gray, Thomas Taxon, James G. Uber, Kevin M. Morley:
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water. Interfaces 39(1): 57-68 (2009) - 2007
- [c22]William E. Hart, Jonathan W. Berry, Robert T. Heaphy, Cynthia A. Phillips:
EXACT: the experimental algorithmics computational toolkit. Experimental Computer Science 2007: 14 - [c21]William E. Hart, Jonathan W. Berry, Erik G. Boman, Cynthia A. Phillips, Lee Ann Riesen, Jean-Paul Watson:
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks. LION 2007: 125-137 - 2006
- [j17]Robert D. Carr, Harvey J. Greenberg, William E. Hart, Goran Konjevod, Erik Lauer, Henry Lin, Tod Morrison, Cynthia A. Phillips:
Robust optimization of contaminant sensor placement for community water systems. Math. Program. 107(1-2): 337-356 (2006) - [p1]Cynthia A. Phillips, Jonathan Eckstein, William E. Hart:
Massively Parallel Mixed-Integer Programming: Algorithms and Applications. Parallel Processing for Scientific Computing 2006: 323-340 - 2005
- [j16]Lauren M. Clevenger, Lauren Ferguson, William E. Hart:
A Filter-Based Evolutionary Algorithm for Constrained Optimization. Evol. Comput. 13(3): 329-352 (2005) - [j15]Tanya Y. Berger-Wolf, William E. Hart, Jared Saia:
Discrete sensor placement problems in distribution networks. Math. Comput. Model. 42(13): 1385-1396 (2005) - [j14]William E. Hart:
Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains. Soft Comput. 9(4): 225-235 (2005) - 2004
- [j13]William E. Hart, N. Ktaliorasnogor, Jim E. Smith:
Editorial Introduction Special Issue on Memetic Algorithms. Evol. Comput. 12(3): v-vi (2004) - [j12]Harvey J. Greenberg, William E. Hart, Giuseppe Lancia:
Opportunities for Combinatorial Optimization in Computational Biology. INFORMS J. Comput. 16(3): 211-231 (2004) - [c20]Lauren M. Clevenger, William E. Hart:
Convergence Examples of a Filter-Based Evolutionary Algorithm. GECCO (1) 2004: 666-677 - [c19]Jean-Paul Watson, Michael J. Collins, William E. Hart, Hai Le, Laura Painton Swiler, Bruce Thompson:
Spares Optimization for the Lockheed Martin Joint Strike Fighter. WSC 2004: 14 - 2003
- [j11]William E. Hart:
Locally-Adaptive and Memetic Evolutionary Pattern Search Algorithms. Evol. Comput. 11(1): 29-51 (2003) - 2002
- [c18]John DeLaurentis, Lauren Ferguson, William E. Hart:
On The Convergence Properties Of A Simple Self-adaptive Evolutionary Algorithm. GECCO 2002: 229-237 - [c17]Robert D. Carr, William E. Hart, Natalio Krasnogor, Jonathan D. Hirst, Edmund K. Burke, James Smith:
Alignment Of Protein Structures With A Memetic Evolutionary Algorithm. GECCO 2002: 1027-1034 - 2001
- [j10]William E. Hart:
A Convergence Analysis of Unconstrained and Bound Constrained Evolutionary Pattern Search. Evol. Comput. 9(1): 1-23 (2001) - [j9]William E. Hart:
Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization. IEEE Trans. Evol. Comput. 5(4): 388-397 (2001) - 2000
- [j8]William E. Hart, Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms. J. Univers. Comput. Sci. 6(6): 560-579 (2000)
1990 – 1999
- 1999
- [j7]John Atkins, William E. Hart:
On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids. Algorithmica 25(2-3): 279-294 (1999) - [j6]William E. Hart, Michael H. Goldbaum, Brad Côté, Paul Kube, Mark R. Nelson:
Measurement and classification of retinal vascular tortuosity. Int. J. Medical Informatics 53(2-3): 239-252 (1999) - [c16]William E. Hart, Keith O. Hunter:
A performance analysis of evolutionary pattern search with generalized mutation steps. CEC 1999: 672-679 - [c15]William E. Hart:
Comparing Evolutionary Programs and Evolutionary Pattern Search Algorithms: A Drug Docking Application. GECCO 1999: 855-862 - 1998
- [j5]Garrett M. Morris, David S. Goodsell, Robert S. Halliday, Ruth Huey, William E. Hart, Richard K. Belew, Arthur J. Olson:
Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function. J. Comput. Chem. 19(14): 1639-1662 (1998) - [j4]William E. Hart:
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search. SIAM J. Optim. 9(1): 270-290 (1998) - [c14]William E. Hart:
On the Application of Evolutionary Pattern Search Algorithms. Evolutionary Programming 1998: 303-312 - 1997
- [j3]William E. Hart, Sorin Istrail:
Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials. J. Comput. Biol. 4(1): 1-22 (1997) - [j2]William E. Hart, Sorin Istrail:
Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal. J. Comput. Biol. 4(3): 241-259 (1997) - [c13]William E. Hart, Michael H. Goldbaum, Brad Côté, Paul Kube, Mark R. Nelson:
Automated measurement of retinal vascular tortuosity. AMIA 1997 - [c12]William E. Hart:
A Generalized Stationary Point Convergence Theory for Evolutionary Algorithms. ICGA 1997: 127-134 - [c11]Christopher D. Rosin, R. Scott Halliday, William E. Hart, Richard K. Belew:
A Comparison of Global and Local Search Methods in Drug Docking. ICGA 1997: 221-229 - [c10]William E. Hart:
On the computational complexity of sequence design problems. RECOMB 1997: 128-136 - [c9]William E. Hart, Sorin Istrail:
Lattice and off-lattice side chain models of protein folding (extended abstract): linear time structure prediction better than 86% of optimal. RECOMB 1997: 137-146 - 1996
- [j1]William E. Hart, Sorin Istrail:
Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal. J. Comput. Biol. 3(1): 53-96 (1996) - [c8]William E. Hart, Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract). CPM 1996: 288-303 - [c7]William E. Hart:
A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing. Evolutionary Programming 1996: 147-154 - [c6]William E. Hart:
A Stationary Point Convergence Theory for Evolutionary Algorithms. FOGA 1996: 325-342 - [c5]William E. Hart, Scott B. Baden, Richard K. Belew, Scott R. Kohn:
Analysis of the Numerical Effects of Parallelism on a Parallel Genetic Algorithm. IPPS 1996: 606-612 - 1995
- [c4]William E. Hart, Sorin Istrail:
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract). STOC 1995: 157-168 - 1994
- [c3]William E. Hart, Thomas E. Kammeyer, Richard K. Belew:
The Role of Development in Genetic Algorithms. FOGA 1994: 315-332 - [c2]William E. Hart, Michael H. Goldbaum:
Registering Retinal Images Using Automatically Selected Control Point Pairs. ICIP (3) 1994: 576-580 - 1991
- [c1]William E. Hart, Richard K. Belew:
Optimising an Arbitrary Function is Hard for the Genetic Algorithm. ICGA 1991: 190-195
Coauthor Index
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-10-07 21:17 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:
