Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Aspects in Information and Management de Qianping Gu

Algorithmic Aspects in Information and Management: Lecture Notes in Computer Science, cartea 8546

Editat de Qianping Gu, Pavol Hell, Boting Yang
en Limba Engleză Paperback – aug 2014
This volume constitutes the proceedings of the International Conference on Algorithmic Aspects in Information and Management, AAIM 2014, held in Vancouver, BC, Canada, in July 2014.
The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32525 lei

Preț vechi: 40656 lei
-20%

Puncte Express: 488
Preț estimativ în valută:
5752€ • 6639$ • 4971£

Carte tipărită la comandă

Livrare economică 01-15 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319079554
ISBN-10: 3319079557
Pagini: 360
Ilustrații: XVI, 342 p. 83 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2014
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.- On the Exact Block Cover Problem.- Minimax Regret k-sink Location Problem in Dynamic Path Network.- Competitive Algorithms for Unbounded One-Way Trading.- The Complexity of Degree Anonymization by Vertex Addition.- Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints.- Edge-Clique Covers of the Tensor Product.- Protein Name Recognition Based on Dictionary Mining and Heuristics.- A Facility Coloring Problem in 1-D.- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes.- The Garden Hose Complexity for the Equality Function.- Finding Robust Minimum Cuts.- A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case.- Multiple Sink Location Problems in Dynamic Path Networks.- Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs.- New Lower Bounds on Broadcast Function.- Efficient Memoization for Approximate Function Evaluation over Sequence Arguments.- Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights.- Obtaining Split Graphs by Edge Contraction.- Parameterized Complexity of Connected Induced Subgraph Problems.- Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times.- Restricted Bipartite Graphs: Comparison and Hardness Results.- The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks.- On P3-Convexity of Graphs with Bounded Degree.- The Competitive Diffusion Game in Classes of Graphs.- A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler.- Clustering Performance of 3-Dimensional Hilbert Curves.- Broadcast Networks with Near Optimal Cost.- An Optimal Context for Information Retrieval.- An Auction-Bargaining Model forInitial Emission Permits.