Muutke küpsiste eelistusi

E-raamat: Algorithmic Aspects in Information and Management: 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Algorithmic Aspects in Information and Management: 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016.The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
Item Pricing for Combinatorial Public Projects.- Norm-Based Locality
Measures of Two-Dimensional Hilbert Curves.- On the Complexity of Clustering
with Relaxed Size Constraints.- Superstring Graph: A New Approach for Genome
Assembly.- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted
Phylogenetic Trees.- A Very Fast String Matching Algorithm Based on Condensed
Alphabets.- Minimum-Density Identifying Codes in Square Grids.- Separating
Codes and Traffic Monitoring.- Know When to Persist: Deriving Value from a
Stream Buffer.- Algorithmic Aspects of Upper Domination: A Parameterised
Perspective.- On Network Formation Games with Heterogeneous Players and Basic
Network Creation Games.- Parameterized Complexity of Team Formation in Social
Networks.- Reconstructing Cactus Graphs from Shortest Path
Information.- Near-Optimal Dominating Setsvia Random Sampling.- A
Multivariate Approach for Checking Resiliency in Access Control.- Efficient
Algorithms for the Order Preserving Pattern Matching Problem.- Computing the
Line-Constrained k-Center in the Plane for Small k.- Online k-max Search
Algorithm with Applications to the Secretary Problem.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833194116822e.html
Märksõnad: