MétaCan
Menu
Back to cohort
Record W2050370986 · doi:10.1109/cec.2012.6256537

SaFESST: Stochastic Fleet Estimation under Steady State Tasking via evolutionary fleet scheduling

2012· article· en· W2050370986 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptimization and Packing Problems
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsComputer scienceScheduling (production processes)Task (project management)Set (abstract data type)State (computer science)Fleet managementStochastic processOperations researchReal-time computingDistributed computingSimulationMathematical optimizationEngineeringAlgorithmMathematicsSystems engineering

Abstract

fetched live from OpenAlex

Militaries involved in transportation of people and cargo need to be able to assess which tasks they can or cannot do given a specified fleet of heterogeneous platforms (such as vehicles or aircraft). We introduce the Stochastic Fleet Estimation under Steady State Tasking (SaFESST) model to determine which tasks will not be achievable. SaFESST is a bin-packing model which uses a fleet configuration (the assignment of specific platforms to each of the tasks) to fit each task from a scenario within the platform bins (the height of the bin represents the number of platforms). Each individual platform is represented by a strip of scenario length which is packed by sub-tasks it can carry out. SaFESST is run on a set of 10,000 scenarios for a single fleet configuration. Results are reported on various statistics of tasks that are unachievable.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.924
Threshold uncertainty score0.757

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.240
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations2
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Packing ProblemsFrench-language works237,207