How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (Q935029): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Experimental research in evolutionary computation. The new experimentalism / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Future of Experimental Research / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3766629 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Severe Testing as a Basic Concept in a Neyman–Pearson Philosophy of Induction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2759665 / rank | |||
Normal rank | |||
Revision as of 13:03, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing |
scientific article |
Statements
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (English)
0 references
31 July 2008
0 references
New experimentalism
0 references
Experimental algorithmics
0 references
Optimization
0 references
Theory of testing
0 references
Mayo's learning model
0 references
Significance
0 references
