On the public citation graph

Statistical Methods for Analyzing Speedup Learning Experiments

https://doi.org/10.1007/bf00993983
0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470316474openalex-snapshot
Statistics
inferredcites →https://doi.org/10.1002/9781118799635.ch13openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.1002/zamm.19770570922openalex-snapshot
Lehmann, E. L. , Nonparametrics: Statistical Methods Based on Ranks, San Francisco. Holden‐Day, Inc., 1975. 480 S., $ 22.95 .
inferredcites →https://doi.org/10.1007/978-1-4613-1703-6openalex-snapshot
Learning Search Control Knowledge
inferredcites →https://doi.org/10.1007/bf00114163openalex-snapshot
A Critical Look at Experimental Evaluations of EBL
inferredcites →https://doi.org/10.1007/bf00115894openalex-snapshot
Acquiring recursive and iterative concepts with explanation-based learning
inferredcites →https://doi.org/10.1007/springerreference_205502openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.1016/0004-3702(93)90035-aopenalex-snapshot
A structural theory of explanation-based learning
inferredcites →https://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
inferredcites →https://doi.org/10.1016/b978-0-12-642350-1.x5017-6openalex-snapshot
Theory of Rank Tests
inferredcites →https://doi.org/10.1016/s1385-7258(52)50042-8openalex-snapshot
A theorem on the sign test when ties are present
inferredcites →https://doi.org/10.1017/cbo9781139167710.003openalex-snapshot
Probability and statistics
inferredcites →https://doi.org/10.1023/a:1022647915955openalex-snapshot
LT Revisited: Explanation-Based Learning and the Logic of Principia Mathematica
inferredcites →https://doi.org/10.1023/a:1022659708512openalex-snapshot
Acquiring Recursive and Iterative Concepts with Explanation-Based Learning
inferredcites →https://doi.org/10.1093/biomet/61.1.17openalex-snapshot
Survival Analyses in Twin Studies and Matched Pair Experiments
inferredcites →https://doi.org/10.1093/biomet/67.3.597openalex-snapshot
Rank Tests for Censored Matched Pairs
inferredcites →https://doi.org/10.1201/9781003456285openalex-snapshot
Statistical Inference
inferredcites →https://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
inferredcites →https://doi.org/10.2307/1268531openalex-snapshot
Nonparametrics: Statistical Methods Based on Ranks
inferredcites →https://doi.org/10.2307/1269817openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.2307/1402416openalex-snapshot
Statistics: A Biomedical Introduction
inferredcites →https://doi.org/10.2307/2283352openalex-snapshot
Mathematical Statistics.
inferredcites →https://doi.org/10.2307/2286553openalex-snapshot
Probability and Statistics.
inferredcites →https://doi.org/10.2307/2287285openalex-snapshot
The Statistical Analysis of Failure Time Data.
inferredcites →https://doi.org/10.2307/2344819openalex-snapshot
Statistics: A Biomedical Introduction.
inferredcites →https://doi.org/10.2307/2529529openalex-snapshot
Nonparametrics: Statistical Methods Based on Ranks.
inferredcites →https://doi.org/10.2307/2530581openalex-snapshot
The Statistical Analysis of Failure Time Data.
inferredcites →https://doi.org/10.7551/mitpress/3314.003.0008openalex-snapshot
Quantitative Results Concerning the Utility of Explanation-Based Learning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-59286-5_49openalex-snapshot
Learning abstract planning cases
inferred← citeshttps://doi.org/10.1007/978-3-319-03680-9_24openalex-snapshot
Evaluating the Seeding Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_18openalex-snapshot
Statistical Methodology for Comparison of SAT Solvers
inferred← citeshttps://doi.org/10.1007/bf00143877openalex-snapshot
Automatically configuring constraint satisfaction programs: A case study
inferred← citeshttps://doi.org/10.1007/s00500-020-05334-4openalex-snapshot
Multithreaded scheduling for program segments based on chemical reaction optimizer
inferred← citeshttps://doi.org/10.1007/s10472-007-9050-9openalex-snapshot
Learning parallel portfolios of algorithms
inferred← citeshttps://doi.org/10.1007/s10472-010-9191-0openalex-snapshot
Tradeoffs in the empirical evaluation of competing algorithm designs
inferred← citeshttps://doi.org/10.1016/0004-3702(93)90035-aopenalex-snapshot
A structural theory of explanation-based learning
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00076-dopenalex-snapshot
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90011-6openalex-snapshot
A unified framework for explanation-based generalization of partially ordered and partially instantiated plans
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90012-4openalex-snapshot
Partial-order planning
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90069-8openalex-snapshot
Automatically generating abstractions for planning
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00115-8openalex-snapshot
Exploratory analysis of speedup learning data using expectation maximization
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00005-7openalex-snapshot
Failure driven dynamic search control for partial order planners: an explanation based approach
inferred← citeshttps://doi.org/10.1108/09555340110366462openalex-snapshot
Implications of Grameen banking system in Europe: prospects and prosperity
inferred← citeshttps://doi.org/10.1145/1993053.1993058openalex-snapshot
Building Mashups by Demonstration
inferred← citeshttps://doi.org/10.1162/153244304773936081openalex-snapshot
10.1162/153244304773936081
inferred← citeshttps://doi.org/10.1613/jair.160openalex-snapshot
Building and Refining Abstract Planning Cases by Change of Representation Language
inferred← citeshttps://doi.org/10.1613/jair.177openalex-snapshot
Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study
inferred← citeshttps://doi.org/10.1613/jair.484openalex-snapshot
A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle
inferred← citeshttps://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
inferred← citeshttps://doi.org/10.29007/bhvjopenalex-snapshot
Statistical Methodology for Comparison of SAT Solvers
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-597openalex-snapshot
Privacy Preserving Landmark Detection
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.