Atnaujinkite slapukų nuostatas

Algorithmic Aspects in Information and Management: 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings 2014 ed. [Minkštas viršelis]

Edited by , Edited by , Edited by
  • Formatas: Paperback / softback, 342 pages, aukštis x plotis: 235x155 mm, weight: 5445 g, 83 Illustrations, black and white; XVI, 342 p. 83 illus., 1 Paperback / softback
  • Serija: Theoretical Computer Science and General Issues 8546
  • Išleidimo metai: 01-Aug-2014
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3319079557
  • ISBN-13: 9783319079554
Kitos knygos pagal šią temą:
Algorithmic Aspects in Information and Management: 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings 2014 ed.Didesnis paveikslėlis
  • Formatas: Paperback / softback, 342 pages, aukštis x plotis: 235x155 mm, weight: 5445 g, 83 Illustrations, black and white; XVI, 342 p. 83 illus., 1 Paperback / softback
  • Serija: Theoretical Computer Science and General Issues 8546
  • Išleidimo metai: 01-Aug-2014
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3319079557
  • ISBN-13: 9783319079554
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9783319079554.html
Raktažodžiai:

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.

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.