Bokus

C. Jeffries – författare

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

4 produkter

  1. C. Jeffries - Mathematical Modeling in Ecology, Häftad. Tillgänglighet: Lägg i varukorg

    Mathematical Modeling in Ecology

    A Workbook for Students

    Av C. Jeffries

    Häftad, 1989

    1095 kr

    Lägg i varukorg

    Mathematical ecology is the application of mathematics to describe and understand ecosystems. There are two main approaches. One is to describe natural communities and induce statistical patterns or relationships which should generally occur. However, this book is devoted entirely to introducing …

  2. C. Jeffries - Code Recognition and Set Selection with Neural Networks, E-bok. Tillgänglighet: Lägg i varukorg

    Code Recognition and Set Selection with Neural Networks

    Av C. Jeffries

    E-bok, 2012

    712 kr

    Lägg i varukorg

    In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, …

  3. C. Jeffries - Mathematical Modeling in Ecology, E-bok. Tillgänglighet: Lägg i varukorg

    Mathematical Modeling in Ecology

    A Workbook for Students

    Av C. Jeffries

    E-bok, 2012

    1459 kr

    Lägg i varukorg

    Mathematical ecology is the application of mathematics to describe and understand ecosystems. There are two main approaches. One is to describe natural communities and induce statistical patterns or relationships which should generally occur. However, this book is devoted entirely to introducing …

  4. C Jeffries - Code Recognition and Set Selection with Neural Networks, Häftad. Tillgänglighet: Lägg i varukorg

    Code Recognition and Set Selection with Neural Networks

    Av C Jeffries

    Häftad, 2011

    551 kr

    Lägg i varukorg

    In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, …