search

rahlk / Experimental-Algorithms

CSC 591: Experimental Algorithms
http://courses.ncsu.edu/csc591/lec/003/
MIT License
0 stars 0 forks source link

Final Presentation #9

Open rahlk opened 8 years ago

rahlk commented 8 years ago

Final Presentation (Skeleton)

rahlk commented 8 years ago

Text for POM3:

" The POM3 model is a tool for exploring that management challenge. POM3 implements the Boehm and Turner model of agile programming [48] where teams select tasks as they appear in the scrum backlog. POM3 can study the implications of different ways to adjust task lists in the face of shifting priorities. The model outputs estimates task completion rates; programmer idle rates; and total overall cost. POM3 represents requirements as a set of trees. POME3 models requirements as a dependency tree. A single requirement in the tree of a prioritization value and a cost, along with a list of child-requirements and dependencies. Before any requirement can be satisfied, its children and dependencies must first be satisfied. POM3 simulates changing priorities by making teams aware of random items in the requirements tree at random intervals, thus forcing teams to constantly readjust their "to do" lists. For further details on this model. "

rahlk commented 8 years ago

XOMO

% For example, the COCOMO model from University of 
% Southern California estimates software development time using a combination of industrial data and some domain expertise
% from its author (Barry Boehm). \fig{coc} shows results from using COCOMO 
% as an oracle to assess our planning methods. In this experiment, random projects were used as COCOMO
% inputs. This generated an development time estimate for each example, which we passed to our four methods.
% 40 times, we let those methods propose changes to those projects. 
% For assessment purposes, the changes projects were then feed back to the COCOMO
% oracle.