1 page matching discrete section in this book
Results 1-1 of 1
What people are saying - Write a review
We haven't found any reviews in the usual places.
Adema Algorithms 1-3 Armstrong 2005 assembled test assembly of multiple Belov & Armstrong Belov and Armstrong Checking constraints combinatorial approach computer adaptive testing Computer simulations constraint C6 constraint programming constraints C1-C13 covariance matrix CPLEX denote discrete section exhausted for example finite set go to Step graph Input integer ranges item usage frequency Law School Admission Linden LSAT MaMf MIP sampling mixed integer programming Move items Move passages multiple nonoverlapping test multiple stage node nonlinear constraints nonoverlapping test forms NP-hard number of items number of nonoverlapping number of passages number of sections positive definite predefined items properties of MIP random variables uniformly randomly withdraw ranges for constraint resulting run Algorithm sampling is uniform sampling of test satisfy constraints sequential procedure set packing Set-Based Section shadow test specified range Step 9 subpool of corresponding test assembly constraints test assembly problem test sampling method Theorem uniform sampling uniform test assembler variables uniformly distributed