Atjaunināt sīkdatņu piekrišanu

E-grāmata: Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II

Edited by , Edited by
  • Formāts: EPUB+DRM
  • Sērija : Lecture Notes in Computer Science 14423
  • Izdošanas datums: 08-Dec-2023
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783031491931
Citas grāmatas par šo tēmu:
  • Formāts - EPUB+DRM
  • Cena: 77,31 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part IIPalielināt
  • Formāts: EPUB+DRM
  • Sērija : Lecture Notes in Computer Science 14423
  • Izdošanas datums: 08-Dec-2023
  • Izdevniecība: Springer International Publishing AG
  • Valoda: eng
  • ISBN-13: 9783031491931
Citas grāmatas par šo tēmu:

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This two volume set volume LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023.  

The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections:

Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks.

Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.



Complexity and Approximation.- Complexity and Enumeration in Models of
Genome Rearrangement.- Conditional automatic complexity and its
metrics.- Streaming and Query Once Space Complexity of Longest Increasing
Subsequence.- Approximating Decision Trees with Priority
Hypotheses.- Approximating the $\lambda$-low-density Value.- Exponential Time
Complexity of the Complex Weighted Boolean \#CSP.- Hardness and approximation
for the star $p$-hub routing cost problem in $\Delta_\beta$-metric
graphs.- Graph Algorithms.- Linear Time Algorithms for NP-hard Problems
restricted to GaTEx Graphs.- Polynomial Turing Compressions for Some Graph
Problems Parameterized by Modular-Width.- Shortest Longest-Path Graph
Orientations.- Sink Location Problems in Dynamic Flow Grid Networks.- List
3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite
Graphs.- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4
Graphs and General Graphs.- Sum-of-Local-Effects Data Structures for
Separable Graphs.- Applied Algorithms.- Variants of Euclidean k-center
Clusterings.- Red-black Spanners for Mixed-charging Vehicular
Networks.- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds
via Locally-iterative Algorithms.- On Detecting Some Defective Items in Group
Testing.- An Efficient Data Analysis Method for Big Data using Multiple-Model
Linear Regression.- Multi-Load Agent Path Finding for Online Pickup and
Delivery Problem.- Improved Sourcewise Roundtrip Spanners with Constant
Stretch.- Randomized Data Partitioning with Efficient Search, Retrieval and
Privacy Preservation.- The k edge-vertex domination
problem.- Resource-Adaptive Newtons Method for Distributed
Learning.- DR-submodular Function Maximization with Adaptive Stepsize.- On
the Routing Problems in Graphs with Ordered Forbidden
Transitions.- DelayingDecisions and Reservation Costs.- A PTAS Framework for
Clustering Problems in Doubling Metrics.- A Physical Zero-knowledge Proof for
Sumplete, a Puzzle Generated by Chat GPT.
Biežāk uzdotie jautājumi par e-grāmatām Biežāk uzdotie jautājumi par e-grāmatām
Permanent link: https://www.kriso.lv/db/97830314919316e.html