Algorithmic Aspects in Information and Management: 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings: Lecture Notes in Computer Science, cartea 6124
Editat de Bo Chenen Limba Engleză Paperback – 5 iul 2010
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 256.27 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 548.35 lei
- 20% Preț: 319.10 lei
- 20% Preț: 611.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 315.78 lei
- 20% Preț: 172.69 lei
- 20% Preț: 1339.86 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 722.40 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.64 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 318.56 lei
Preț vechi: 398.20 lei
-20% Nou
Puncte Express: 478
Preț estimativ în valută:
60.98€ • 65.56$ • 50.83£
60.98€ • 65.56$ • 50.83£
Carte disponibilă
Livrare economică 28 noiembrie-12 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642143540
ISBN-10: 3642143547
Pagini: 347
Ilustrații: XI, 336 p. 51 illus.
Greutate: 0.52 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642143547
Pagini: 347
Ilustrații: XI, 336 p. 51 illus.
Greutate: 0.52 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Information Systems and Applications, incl. Internet/Web, and HCI
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Comparison of Two Algorithms for Computing Page Importance.- The Invisible Hand for Risk Averse Investment in Electricity Generation.- Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.- The (K,k)-Capacitated Spanning Tree Problem.- Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier.- Synthetic Road Networks.- Computing Exact and Approximate Nash Equilibria in 2-Player Games.- Where Would Refinancing Preferences Go?.- Approximating Maximum Edge 2-Coloring in Simple Graphs.- A Linear Kernel for Co-Path/Cycle Packing.- A VaR Algorithm for Warrants Portfolio.- Some Results on Incremental Vertex Cover Problem.- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction.- Point Location in the Continuous-Time Moving Network.- Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints.- Inverse 1-median Problem on Trees under Weighted l ??? Norm.- On the Approximability of the Vertex Cover and Related Problems.- Feasibility Testing for Dial-a-Ride Problems.- Indexing Similar DNA Sequences.- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint.- A New Smoothing Newton Method for Symmetric Cone Complementarity Problems.- Approximation Algorithms for Scheduling with a Variable Machine Maintenance.- Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines.- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles.- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive.- A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem.- Optimal Semi-online SchedulingAlgorithms on Two Parallel Identical Machines under a Grade of Service Provision.- Varieties of Regularities in Weighted Sequences.- Online Uniformly Inserting Points on Grid.- Kernelization for Cycle Transversal Problems.- Online Splitting Interval Scheduling on m Identical Machines.- Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-criteria Analysis.- Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery.
Caracteristici
Up-to-date results Fast track conference proceedings State-of-the-art results