
Meer over het boek
Inhaltsverzeichnis includes invited and contributed papers covering a range of topics in concurrency, optimization, and computational theory. Key discussions involve shared-variable concurrency, approximation algorithms for stochastic optimization, and configurations on finite point sets. Contributions in Track A focus on normal and feature approximations from noisy point clouds, coresets for discrete integration, and self-assembling shapes with minimal tiles. Other highlights include challenges in multi-stack boundary labeling, center-transversal line computation, and pseudorandomness derived from error-correcting codes. Fast algorithms for maximum r-regular induced subgraphs and connected dominating sets are also explored. Track B contributions delve into rational behavior in multiplayer games, probabilistic equivalence testing via reinforcement learning, and the decidability of LTL model checking for process rewrite systems. Additional topics include monitoring real-time properties, a proof system for linear time ?-calculus, and the use of tree automata in ordinal theory. The section also addresses reduction criteria for probabilistic reward models and distributed synthesis for well-connected architectures. The expressivity of Boolean BI through relational models, strategies in priced timed games, and validity checking for finite automata over linear arithmetic constraints are examined, alongside game semantics for higher-
Een boek kopen
Foundations of software technology and theoretical computer science, S. Arun-Kumar
- Taal
- Jaar van publicatie
- 2006
- product-detail.submit-box.info.binding
- (Paperback)
Betaalmethoden
Nog niemand heeft beoordeeld.