MétaCan
Menu
Back to cohort
Record W2805215296 · doi:10.1142/s0129054119500102

Tight Bounds for Restricted Grid Scheduling

2019· article· en· W2805215296 on OpenAlexafffund
Joan Boyar, Faith Ellen

Bibliographic record

VenueInternational Journal of Foundations of Computer Science · 2019
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Search Problems
Canadian institutionsUniversity of Toronto
FundersCanadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of CanadaVillum FondenVelux FondenNatur og Univers, Det Frie Forskningsråd
KeywordsComputer scienceGridScheduling (production processes)Parallel computingDistributed computingMathematicsMathematical optimizationGeometry

Abstract

fetched live from OpenAlex

The following problem is considered: Items with integer sizes are given and variable sized bins arrive online. A bin must be used if there is still an item remaining which fits in it when the bin arrives. The goal is to minimize the total size of all the bins used. Previously, a lower bound of [Formula: see text] on the competitive ratio of this problem was achieved using items of size [Formula: see text] and [Formula: see text]. For these item sizes and maximum bin size [Formula: see text], we obtain asymptotically matching upper and lower bounds, which vary depending on the ratio of the number of small items to the number of large items.

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.

How this classification was reachedexpand

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.715
Threshold uncertainty score0.551

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0030.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.021
GPT teacher head0.321
Teacher spread0.300 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueInternational Journal of Foundations of Computer ScienceSame topicOptimization and Search ProblemsFrench-language works237,207