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.

Produktinformation

Utgivningsdatum2014-08-01
Mått155 x 235 x 20 mm
Vikt546 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor342
FörlagSpringer International Publishing AG
ISBN9783319079554

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

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.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Del 8546

Heterogenität - Intersektionalität - Diversity in der Erziehungswissenschaft

Katharina Walgenbach

Häftad, 2017

379 kr

Del 15180

Algorithmic Aspects in Information and Management

Smita Ghosh, Zhao Zhang

Häftad, 2024

939 kr

Del 11343

Algorithmic Aspects in Information and Management

Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko

Häftad, 2018

729 kr

Del 9778

Algorithmic Aspects in Information and Management

Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri

Häftad, 2016

749 kr

Algorithmic Aspects in Information and Management

Andrew Goldberg, Yunhong Zhou

Häftad, 2009

749 kr

Algorithmic Aspects in Information and Management

Xiang Li, Zhao Zhang

Häftad, 2026

879 kr

Algorithmic Aspects in Information and Management

Bo Chen

Häftad, 2010

749 kr

Algorithmic Aspects in Information and Management

Ming-Yang Kao, Xiang-Yang Li

Häftad, 2007

749 kr

Del 12290

Algorithmic Aspects in Information and Management

Zhao Zhang, Wei Li, Ding-Zhu Du

Häftad, 2020

729 kr

Del 16379

Algorithmic Aspects in Information and Management

Altannar Chinchuluun, Rentsen Enkhbat, Ding-Zhu Du

Häftad, 2026

2 159 kr

Del 8546 i serien Lecture Notes in Computer Science

Algorithmic Aspects in Information and Management

10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014, Proceedings

Häftad, Engelska, 2014

AvQianping Gu,Pavol Hell,Boting Yang

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 159 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2014-08-01
Mått155 x 235 x 20 mm
Vikt546 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor342
FörlagSpringer International Publishing AG
ISBN9783319079554

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

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.