MétaCan
Menu
Back to cohort
Record W1921408347

Software release planning with time-dependent value functions and flexible release dates

2007· article· en· W1921408347 on OpenAlexaff
Jim Mc Elroy, Guenther Ruhe

Bibliographic record

VenueInternational Conference on Software Engineering · 2007
Typearticle
Languageen
FieldComputer Science
TopicSoftware Engineering Techniques and Practices
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSoftware release life cycleValue (mathematics)Interval (graph theory)Computer scienceSoftwareResource (disambiguation)Genetic algorithmProduct (mathematics)Key (lock)Operations researchSoftware developmentEngineeringSoftware qualityMathematics
DOInot available

Abstract

fetched live from OpenAlex

Release planning is of key importance for incremental software product development. In conjunction with the value and the effort needed to implement features, decisions need to be made as to which features are offered in which releases. The value of features can vary over time depending on market conditions, competition, contractual constraints, and other concerns. Release dates and the specific features placed in releases need to be determined in a way that maximizes the overall value related to the investments made. The main contributions of the paper are (i) the formulation of value-driven release planning where we allow time time-dependent value functions to express the value of features potentially assigned to releases, (ii) time-dependent functions expressing the resource capacities needed for implementing features, (iii) a solution method using genetic algorithms to determine release plans allowing variation of the release dates within a pre-defined interval of feasibility, and (iv) providing a proof-of-concept for the proposed approach by running a case study.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.010
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.022
GPT teacher head0.269
Teacher spread0.248 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations3
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueInternational Conference on Software EngineeringSame topicSoftware Engineering Techniques and PracticesFrench-language works237,207