Jaroslav M. Fowkes

Orcid: 0000-0002-8048-4572

According to our database1, Jaroslav M. Fowkes authored at least 14 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximating sparse Hessian matrices using large-scale linear least squares.
Numer. Algorithms, August, 2024

2023
GALAHAD 4.0: an open source library of Fortran packages with C and Matlab interfaces for continuous optimization.
J. Open Source Softw., 2023

2022
PyCUTEst: an open source Python package of optimization test problems.
J. Open Source Softw., October, 2022

A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares.
CoRR, 2022

2019
Gaussian processes for unconstraining demand.
Eur. J. Oper. Res., 2019

2017
Autofolding for Source Code Summarization.
IEEE Trans. Software Eng., 2017

2016
Parameter-free probabilistic API mining across GitHub.
Proceedings of the 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2016

A Bayesian Network Model for Interesting Itemsets.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

A Subsequence Interleaving Model for Sequential Pattern Mining.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

TASSAL: autofolding for source code summarization.
Proceedings of the 38th International Conference on Software Engineering, 2016

2015
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties.
J. Glob. Optim., 2015

Parameter-Free Probabilistic API Mining at GitHub Scale.
CoRR, 2015

2014
Autofolding for Source Code Summarization.
CoRR, 2014

2013
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions.
J. Glob. Optim., 2013


  Loading...