Bokus

Talha Amin – författare

Visar alla böcker från författaren Talha Amin. Handla med fri frakt och snabb leverans.

3 produkter

  1. Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov - Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, Häftad. Tillgänglighet: Lägg i varukorg

    Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

    Av Hassan AbouEisha, Talha Amin m. fl.

    Häftad, 2019

    1129 kr

    Lägg i varukorg

    Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given …

  2. Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov - Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, Inbunden. Tillgänglighet: Lägg i varukorg

    Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

    Av Hassan AbouEisha, Talha Amin m. fl.

    Inbunden, 2018

    1129 kr

    Lägg i varukorg

    Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given …

  3. Mikhail Moshkov, Shahid Hussain, Igor Chikalov, Talha Amin, Hassan AbouEisha - Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining, E-bok. Tillgänglighet: Lägg i varukorg

    Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

    Av Mikhail Moshkov, Shahid Hussain m. fl.

    E-bok, 2018

    1470 kr

    Lägg i varukorg

    Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given …