Geschäftskunden Kundenprogramme
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithmic Aspects in Information and Management
  • Produktbild: Algorithmic Aspects in Information and Management
Band 8546

Algorithmic Aspects in Information and Management 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 72.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

01.08.2014

Abbildungen

XVI, 342 p. 83 illus.

Herausgeber

Qianping Gu + weitere

Verlag

Springer

Seitenzahl

342

Maße (L/B/H)

23.5/15.5/2 cm

Gewicht

546 g

Sprache

Englisch

ISBN

978-3-319-07955-4

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

01.08.2014

Abbildungen

XVI, 342 p. 83 illus.

Herausgeber

Verlag

Springer

Seitenzahl

342

Maße (L/B/H)

23.5/15.5/2 cm

Gewicht

546 g

Sprache

Englisch

ISBN

978-3-319-07955-4

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Aspects in Information and Management
  • Produktbild: Algorithmic Aspects in Information and Management

  • 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 P 3-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.