HIGHLIGHTS
- who: u041eu0411u0420u0410u0411u041eu0422u041au0410 u0418u041du0424u041eu0420u041cu0410u0426u0418u0418 u0418 u041fu0420u0418u041du042fu0422u0418u0415 et al. from the Belarusian National Technical University have published the article: u041eu0411u0420u0410u0411u041eu0422u041au0410 u0418u041du0424u041eu0420u041cu0410u0426u0418u0418 u0418 u041fu0420u0418u041du042fu0422u0418u0415 u0420u0415u0428u0415u041du0418u0419 PRIHOZHY u0410.u0410, in the Journal: (JOURNAL)
- what: The authors formulate a combinatorial problem and propose a heuristic greedy and an exact optimal algorithm of allocating experts to a maximum set of programmer teams, assuming that two teams may not share the same expert. The greedy Algorithm 1 the authors propose heuristical-ly allocates experts to teams and finds a subopti-mal solution in general case. Algorithm 3 the authors propose takes into . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.