Muutke küpsiste eelistusi

E-raamat: Frontiers of Algorithmics: 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 Proceedings

Edited by , Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 80,26 €*
  • * 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.
Frontiers of Algorithmics: 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 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 book constitutes the refereed proceedings of the 17th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2023), consisting of the 17th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 4th International Joint Conference on Theoretical Computer Science (IJTCS), held in Macau, China, during August 1418, 2023.

FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science.





To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field.  The 21 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: algorithmic game theory; algorithms and data structures; combinatorial optimization; and computational economics.
Understanding the Relationship Between Core Constraints
and Core-Selecting Payment Rules in Combinatorial Auctions.- An Improved
Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack
Maximization.- Generalized Sorting with Predictions Revisited.- Eliciting
Truthful Reports with Partial Signals in Repeated Games.- On the NP-hardness
of two scheduling problems under linear constraints.- On the Matching Number
of k-Uniform Connected Hypergraphs with Maximum Degree.- Max-Min Greedy
Matching Problem: Hardness for the Adversary and Fractional
Variant.- Approximate Core Allocations for Edge Cover Games.- Random
Approximation Algorithms for Monotone k-Submodular Function Maximization with
Size Constraints.- Additive Approximation Algorithms for Sliding
Puzzle.- Differential Game Analysis for Cooperation Models in
Automotive Supply Chain under Low-Carbon Emission Reduction
Policies.- Adaptivity Gap for Influence Maximization with Linear
Threshold Model on Trees.- Physically Verifying the First Nonzero Term in a
Sequence: Physical ZKPs for ABC End View and Goishi Hiroi.- Mechanism Design
in Fair Sequencing.- Red-Blue Rectangular Annulus Cover Problem.- Applying
Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops.- The Fair
k-Center with Outliers Problem: FPT and
Polynomial Approximations.- Constrained Graph Searching on Trees.- EFX
Allocations Exist for Binary Valuations.- Maximize Egalitarian Welfare for
Cake Cutting.- Stackelberg Strategies on Epidemic Containment Games.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830313934406e.html
Märksõnad: