Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Sean B Holden"'
Autor:
Lisa M Breckels, Sean B Holden, David Wojnar, Claire M Mulvey, Andy Christoforou, Arnoud Groen, Matthew W B Trotter, Oliver Kohlbacher, Kathryn S Lilley, Laurent Gatto
Publikováno v:
PLoS Computational Biology, Vol 12, Iss 5, p e1004920 (2016)
Sub-cellular localisation of proteins is an essential post-translational regulatory mechanism that can be assayed using high-throughput mass spectrometry (MS). These MS-based spatial proteomics experiments enable us to pinpoint the sub-cellular distr
Externí odkaz:
https://doaj.org/article/c25995a02a4b4247953bc222acc05e9e
Publikováno v:
Measurement + Control, Vol 34 (2001)
Externí odkaz:
https://doaj.org/article/4f0075b3066741d99d96fdbfdd2da65a
Machine learning systems based on minimizing average error have been shown to perform inconsistently across notable subsets of the data, which is not exposed by a low average error for the entire dataset. In consequential social and economic applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70483fd323faffd30e3fcdf9d0909cf6
Autor:
Xiangyu Zhao, Sean B. Holden
Publikováno v:
2022 IEEE Conference on Games (CoG).
Publikováno v:
AAAI
Modern theorem provers utilise a wide array of heuristics to control the search space explosion, thereby requiring optimisation of a large set of parameters. An exhaustive search in this multi-dimensional parameter space is intractable in most cases,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d36ca2d82e3700fa239efa83ee5e8392
Publikováno v:
Automated Reasoning. IJCAR 2022
Automated Reasoning ISBN: 9783031107689
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Reasoning
Automated Reasoning ISBN: 9783031107689
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Reasoning
Astrategy scheduleallocates time to proof strategies that are used in sequence in a theorem prover. We employ Bayesian statistics to propose alternative sequences for the strategy schedule in each proof attempt. Tested on the TPTP problem library, ou
Autor:
Sean B. Holden
The decision problem for Boolean satisfiability, generally referred to as SAT, is the archetypal NP-complete problem, and encodings of many problems of practical interest exist allowing them to be treated as SAT problems. Its generalization to quanti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ac15eb5e3293c6d90d190c752c9d280
https://doi.org/10.1561/9781680838992
https://doi.org/10.1561/9781680838992
Autor:
Sean B. Holden
Automated theorem proving represents a significant and long-standing area of research in computer science, with numerous applications. A large proportion of the methods developed to date for the implementation of automated theorem provers (ATPs) have
Publikováno v:
Journal of Automated Reasoning. 53:141-172
We applied two state-of-the-art machine learning techniques to the problem of selecting a good heuristic in a first-order theorem prover. Our aim was to demonstrate that sufficient information is available from simple feature measurements of a conjec
Autor:
Sean B. Holden
HasGP is a library providing supervised learning algorithms for Gaussian process (GP) regression and classification. While only one of many GP libraries available, it differs in that it represents an ongoing exploration of how machine learning resear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3be582dba2f4a54d10e0097adffa4067