Del 15828 i serien Lecture Notes in Computer Science

Frontiers of Algorithmics

19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Häftad, Engelska, 2025

AvVincent Chau,Christoph Dürr,Minming Li,Pinyan Lu

1 079 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book LNCS15828 constitutes the refereed proceedings of the 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2025), consisting of the 19th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 6th International Joint Conference on Theoretical Computer Science (IJTCS), held in Paris, France, during June 30–July 2, 2025.The 28 full papers and 2 short papers were carefully reviewed and selected from 63 submissions. The proceedings focuses on Frontiers of Algorithmic Wisdom; Block-chain, Distributed Computing, Multi-Agents; Game Theory, Algorithmic Game Theory, Machine Learning, Electronic Commerce.

Produktinformation

Utgivningsdatum2025-06-30
Mått155 x 235 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor416
FörlagSpringer Nature Switzerland AG
ISBN9789819683116

Tillhör följande kategorier

Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter.- $k$-Universality of Regular Languages Revisited.- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions.- Complexity Classes for Online Problems with and without Predictions.- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model.- Mixed Graph Covering with Target Constraints.- Multiplication of 0-1 matrices via clustering.- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem.- Approximation Algorithms for Individual Preference Facility Location.- The online power cover problem on a line.- The Subinterval Cover Problem.- Oblivious Robots Under Round Robin: Gathering on Rings.- Finding a Set of Long Common Substrings with Repeats from m Input Strings.- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties.- Less-excludable Mechanism for DAOs in Public Good Auctions.- TBDS: Transaction-Based Data Sharing.- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents.- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer.- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources.- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms.- Minimizing Blocking Agents for Stable Matching with Partial Approval Information.- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives.- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games.- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints.- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems.- Large-Scale Contextual Market Equilibrium Computation through Deep Learning.- Fair Value Distribution in Cooperative Committee Election.- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs.- Mechanism Design for Auctions with Externalities on Budgets.

Du kanske också är intresserad av

Del 15828

Friedrich Schiller: Maria Stuart (Lehrerband) | Mit Downloadpaket (Unterrichtsmaterialien)

Annemarie Niklas

Häftad, 2024

349 kr

Parallel Architectures, Algorithms and Programming

Li Ning, Vincent Chau, Francis Lau

Häftad, 2021

749 kr

mathe.delta Bayern 11

Dieter Bergmann, Anne Brendel, Christoph Dürr, Franz Eisentraut, Christoph Kastner, Martina Schmidt-Kessel, Anne Brendel, Martina Schmidt-Kessel, Franz Eisentraut

Inbunden, 2023

699 kr

mathe.delta10 Schülerband Gymnasium Bayern

Anne Brendel, Christoph Dürr, Franz Eisentraut, Verena Lauffer, Martina Schmidt-Kessel, Anne Brendel, Franz Eisentraut

Inbunden, 2022

699 kr

mathe.delta 10 Lösungsband Gymnasium Bayern

Anne Brendel, Christoph Dürr, Franz Eisentraut, Elfriede Kempf, Verena Lauffer, Martina Schmidt-Kessel, Anne Brendel, Franz Eisentraut

Häftad, 2023

729 kr

mathe.delta Bayern LB 12

Dieter Bergmann, Anne Brendel, Christoph Dürr, Sabrina Fuchs, Christoph Kastner, Elias Peipp, Andreas Schmidt-Kessel, Martina Schmidt-Kessel, Anne Brendel, Martina Schmidt-Kessel

Häftad, 2025

739 kr

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang

Häftad, 2012

729 kr

Theoretical Computer Science

Lian Li, Pinyan Lu, Kun He

Häftad, 2018

749 kr

Del 10823

Frontiers in Algorithmics

Jianer Chen, Pinyan Lu

Häftad, 2018

729 kr

Digital Finance

Pinyan Lu, Zhihui Lu, Dawei Cheng

Häftad, 2026

1 109 kr

Del 15828 i serien Lecture Notes in Computer Science

Frontiers of Algorithmics

19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Häftad, Engelska, 2025

AvVincent Chau,Christoph Dürr,Minming Li,Pinyan Lu

1 079 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2025-06-30
Mått155 x 235 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor416
FörlagSpringer Nature Switzerland AG
ISBN9789819683116

Tillhör följande kategorier

Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter.- $k$-Universality of Regular Languages Revisited.- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions.- Complexity Classes for Online Problems with and without Predictions.- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model.- Mixed Graph Covering with Target Constraints.- Multiplication of 0-1 matrices via clustering.- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem.- Approximation Algorithms for Individual Preference Facility Location.- The online power cover problem on a line.- The Subinterval Cover Problem.- Oblivious Robots Under Round Robin: Gathering on Rings.- Finding a Set of Long Common Substrings with Repeats from m Input Strings.- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties.- Less-excludable Mechanism for DAOs in Public Good Auctions.- TBDS: Transaction-Based Data Sharing.- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents.- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer.- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources.- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms.- Minimizing Blocking Agents for Stable Matching with Partial Approval Information.- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives.- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games.- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints.- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems.- Large-Scale Contextual Market Equilibrium Computation through Deep Learning.- Fair Value Distribution in Cooperative Committee Election.- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs.- Mechanism Design for Auctions with Externalities on Budgets.

Du kanske också är intresserad av

Del 15828

Friedrich Schiller: Maria Stuart (Lehrerband) | Mit Downloadpaket (Unterrichtsmaterialien)

Annemarie Niklas

Häftad, 2024

349 kr

Parallel Architectures, Algorithms and Programming

Li Ning, Vincent Chau, Francis Lau

Häftad, 2021

749 kr

mathe.delta Bayern 11

Dieter Bergmann, Anne Brendel, Christoph Dürr, Franz Eisentraut, Christoph Kastner, Martina Schmidt-Kessel, Anne Brendel, Martina Schmidt-Kessel, Franz Eisentraut

Inbunden, 2023

699 kr

mathe.delta10 Schülerband Gymnasium Bayern

Anne Brendel, Christoph Dürr, Franz Eisentraut, Verena Lauffer, Martina Schmidt-Kessel, Anne Brendel, Franz Eisentraut

Inbunden, 2022

699 kr

mathe.delta 10 Lösungsband Gymnasium Bayern

Anne Brendel, Christoph Dürr, Franz Eisentraut, Elfriede Kempf, Verena Lauffer, Martina Schmidt-Kessel, Anne Brendel, Franz Eisentraut

Häftad, 2023

729 kr

mathe.delta Bayern LB 12

Dieter Bergmann, Anne Brendel, Christoph Dürr, Sabrina Fuchs, Christoph Kastner, Elias Peipp, Andreas Schmidt-Kessel, Martina Schmidt-Kessel, Anne Brendel, Martina Schmidt-Kessel

Häftad, 2025

739 kr

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang

Häftad, 2012

729 kr

Theoretical Computer Science

Lian Li, Pinyan Lu, Kun He

Häftad, 2018

749 kr

Del 10823

Frontiers in Algorithmics

Jianer Chen, Pinyan Lu

Häftad, 2018

729 kr

Digital Finance

Pinyan Lu, Zhihui Lu, Dawei Cheng

Häftad, 2026

1 109 kr

Frontiers of Algorithmics

19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Frontiers of Algorithmics

19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Frontiers of Algorithmics

19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av