Frontiers in Algorithms: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6213
Editat de D.T. Lee, Danny Z. Chen, Shi Yingen Limba Engleză Paperback – 12 iul 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 426.75 lei - 20%
Preț: 315.62 lei - 20%
Preț: 320.92 lei - 15%
Preț: 426.53 lei - 20%
Preț: 313.87 lei - 20%
Preț: 355.79 lei - 20%
Preț: 355.54 lei - 20%
Preț: 355.18 lei - 20%
Preț: 390.68 lei - 20%
Preț: 392.03 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.79 lei - 20%
Preț: 495.44 lei - 20%
Preț: 498.80 lei - 20%
Preț: 498.50 lei - 20%
Preț: 355.93 lei - 20%
Preț: 639.52 lei - 20%
Preț: 499.90 lei - 20%
Preț: 498.95 lei - 20%
Preț: 390.42 lei - 20%
Preț: 326.81 lei - 20%
Preț: 391.36 lei - 20%
Preț: 321.68 lei - 20%
Preț: 498.90 lei - 20%
Preț: 312.82 lei - 20%
Preț: 496.73 lei - 20%
Preț: 320.72 lei - 20%
Preț: 497.25 lei - 15%
Preț: 496.40 lei - 20%
Preț: 324.19 lei - 20%
Preț: 498.80 lei - 20%
Preț: 461.86 lei - 20%
Preț: 355.59 lei -
Preț: 418.19 lei - 20%
Preț: 498.59 lei - 20%
Preț: 391.28 lei - 20%
Preț: 355.69 lei - 15%
Preț: 499.72 lei - 20%
Preț: 499.40 lei - 20%
Preț: 458.84 lei - 20%
Preț: 390.42 lei - 20%
Preț: 270.68 lei - 20%
Preț: 497.75 lei - 20%
Preț: 423.78 lei - 20%
Preț: 322.32 lei - 20%
Preț: 322.09 lei - 20%
Preț: 427.09 lei - 20%
Preț: 499.90 lei - 20%
Preț: 463.03 lei
Preț: 323.41 lei
Preț vechi: 404.26 lei
-20% Nou
Puncte Express: 485
Preț estimativ în valută:
57.22€ • 66.76$ • 50.03£
57.22€ • 66.76$ • 50.03£
Carte disponibilă
Livrare economică 26 decembrie 25 - 09 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642145520
ISBN-10: 3642145523
Pagini: 352
Ilustrații: XI, 339 p. 74 illus.
Greutate: 0.52 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642145523
Pagini: 352
Ilustrații: XI, 339 p. 74 illus.
Greutate: 0.52 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Progress on Certifying Algorithms.- Computational Geometry for Uncertain Data.- On Foundations of Services Interoperation in Cloud Computing.- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets.- Truthful Auction for CPU Time Slots.- Top-d Rank Aggregation in Web Meta-search Engine.- Minimum Common String Partition Revisited.- Inapproximability of Maximal Strip Recovery: II.- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy.- Approximation Schemes for Scheduling with Availability Constraints.- An Space Lower Bound for Finding ?-Approximate Quantiles in a Data Stream.- Improved Sublinear Time Algorithm for Width-Bounded Separators.- Constant Time Generation of Biconnected Rooted Plane Graphs.- Solving General Lattice Puzzles.- A Hybrid Graph Representation for Recursive Backtracking Algorithms.- On Tractable Exponential Sums.- Recognizing d-Interval Graphs and d-Track Interval Graphs.- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem.- Approximation Algorithms for the Capacitated Domination Problem.- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle.- FPTAS’s for Some Cut Problems in Weighted Trees.- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.- Online Algorithms for the Newsvendor Problem with and without Censored Demands.- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems.- Path Separability of Graphs.- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.- Computing Minimum Diameter Color-Spanning Sets.- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares.- Optimum Sweeps ofSimple Polygons with Two Guards.- Adaptive Algorithms for Planar Convex Hull Problems.- New Algorithms for Barrier Coverage with Mobile Sensors.