Coverart for item
The Resource Algorithmic Aspects in Information and Management : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings

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

Label
Algorithmic Aspects in Information and Management : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings
Title
Algorithmic Aspects in Information and Management
Title remainder
10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings
Creator
Contributor
Language
eng
Member of
Cataloging source
MiAaPQ
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Series volume
v.8546
Algorithmic Aspects in Information and Management : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings
Label
Algorithmic Aspects in Information and Management : 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings
Link
http://libproxy.rpi.edu/login?url=https://ebookcentral.proquest.com/lib/rpi/detail.action?docID=3093341
Publication
Copyright
Related Contributor
Related Location
Related Agents
Related Items
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Preface -- Organization -- Invited Talks -- Computational Insights and the Theory of Evolution -- Approximating Semantics -- Table of Contents -- Contributed Papers -- Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme -- 1 Introduction -- 1.1 Simple Majority Voting Scheme -- 1.2 Previous Work -- 1.3 Our Results -- 2 Analysis for General Event Regions -- 2.1 Proof of Theorem 1 -- 2.2 Proof of Theorem 2 -- 3 Analysis for Convex Event Regions with Round Boundary -- 3.1 Upper Bound on the Misclassified Good Sensors -- 3.2 Upper Bound on the Misclassified Bad Sensors -- References -- On the Exact Block Cover Problem -- 1 Introduction -- 2 Preliminaries -- 3 Hardness for EBCc -- 4 2-EBC Is Polynomially Solvable -- 5 3-EBC Is Polynomially Solvable -- 6 A Better FPT Algorithm for EBC -- 7 Closing Remarks -- References -- Minimax Regret k-sink Location Problem in Dynamic Path Networks -- 1 Introduction -- 2 Preliminaries -- 3 Properties and Algorithms for Certain k-sink Problem -- 4 Properties and Algorithms for Minimax Regret k-sink Problem -- 5 Future Directions -- References -- Competitive Algorithms for Unbounded One-Way Trading -- 1 Introduction -- 2 Upper Bound -- 3 Lower Bound -- 4 Conclusion -- References -- The Complexity of Degree Anonymization by Vertex Addition -- 1 Introduction -- 2 Preliminaries and Problem Definitions -- 3 Constrained Degree Anonymization -- 4 Plain Degree Anonymization -- 5 Conclusion -- References -- Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints -- 1 Introduction -- 1.1 Literature Review -- 1.2 New Contributions -- 1.3 Organization -- 2 Preliminaries -- 3 Pm{u2212}1,1
  • 3 Edge-Clique Covers -- 4 The Prime Case -- 5 The Projective Plane Case -- 6 An Upperbound and a Limiting Value for ke(Kn {u00D7}Kn) -- References -- Protein Name Recognition Based on Dictionary Mining and Heuristics -- 1 Introduction -- 2 Related Works -- 3 PNRS -- 3.1 Core Token Selector (CTS) -- 3.2 Significant Sequential Pattern (SSP) Miner -- 3.3 Core Token Extender (CTE) -- 3.4 Protein Name Filter -- 4 Experiment and Evaluation -- 4.1 Experiments: SSP (AD-Threshold) -- 5 Conclusion -- References -- A Facility Coloring Problem in 1-D -- 1 Introduction -- 2 Notations and Definitions -- 3 n = 2c -- 4 n = kc, k > 2 -- 5 n = kc + m -- 5.1 Coloring C2 -- 5.2 Coloring CE -- 5.3 Optimality of CE -- 6 Conclusions -- References -- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes -- 1 Introduction -- 2 Preliminaries -- 3
  • 2 Literature Review -- 3 Problem Description -- 4 Solution Approach: A Hybrid Genetic Algorithm (HGA) -- 4.1 Chromosome Representation -- 4.2 Generating the First Population -- 4.3 Crossover -- 4.4 Mutation: Nearest Neighbor Method -- 4.5 Selection Procedure -- 5 Experimental Study -- 5.1 Parameter Tuning -- 5.2 Experimental Results -- 6 Conclusion -- References -- Multiple Sink Location Problems in Dynamic Path Networks -- 1 Introduction -- 2 Minimax k-sink Location Problem -- 2.1 Definitions -- 2.2 Recursive Formulation -- 2.3 Properties -- 2.4 Algorithm -- 2.5 Data Structure -- 2.6 Time Complexity -- 3 Minisum k-sink Location Problem -- 3.1 Properties of the Minisum 1-sink Location Problem -- 3.2 Algorithm and Time Complexity for the Minisum 1-sink Location Problem -- 3.3 Extension to the Minisum k-sink Location Problem -- 4 Conclusion -- References -- Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs -- 1 Introduction -- 2 New Results for List Colouring -- 3 New Results for Precolouring Extension -- 4 New Results for Colouring -- 5 Proof of Theorem 1 -- 6 Open Problems -- References -- New Lower Bounds on Broadcast Function -- 1 Introduction -- 2 Lower Bound on B(2k {u2212} 7) -- 3 Lower Bound on B(2k {u2212} 2p + 1) -- 4 Lower Bound on B(2k {u2212} 2p) -- 5 About the Value of B(24) -- 6 Summary -- References -- Efficient Memoization for Approximate Function Evaluation over Sequence Arguments -- 1 Introduction -- 2 Estimating Probabilities and Means -- 3 The Tapered Grid Data Structures -- 4 Interpolation Algorithm -- 5 Experimental Results -- 6 Conclusions and Future Work -- References -- Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights -- 1 Introduction -- 2 Problem Statements and Notations -- 3 Fundamental Properties -- 4 Local Search Algorithm -- 5 Average Case Analysis -- 6 Concluding Remarks -- References
  • Obtaining Split Graphs by Edge Contraction -- 1 Introduction -- 2 Preliminaries -- 3 FPT Algorithm -- 4 Incompressibility -- 5 Concluding Remarks -- References -- Parameterized Complexity of Connected Induced Subgraph Problems -- 1 Introduction -- 2 FPT Algorithms -- 3 W[1]-Hardness -- 4 The Remaining Case -- 5 Concluding Remarks -- References -- Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times -- 1 Introduction -- 2 Problem Definition -- 3 Hierarchical Scheduling with Bounded Processing Times -- 3.1 Lower Bounds of Competitive Ratio -- 3.2 An Optimal Algorithm -- 4 Hierarchical Scheduling with Total Processing Time -- 4.1 Lower Bounds of Competitive Ratio -- 4.2 An Optimal Algorithm -- 5 Conclusion -- References -- Restricted Bipartite Graphs: Comparison and Hardness Results -- 1 Introduction -- 2 Preliminaries -- 3 Comparison Results -- 4 Hardness Results -- 5 Conclusions -- References -- The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks -- 1 Introduction -- 2 Preliminaries -- 2.1 Representation -- 2.2 QENN -- 3 Termination Criterion -- 4 Experimental Results -- 5 Conclusion -- References -- On P3-Convexity of Graphs with Bounded Degree -- 1 Introduction -- 1.1 Planar SAT-am3 -- 2 P3-Hull Set -- 3 P3-Geodetic Set -- References -- The Competitive Diffusion Game in Classes of Graphs -- 1 Introduction -- 2 Trees, Paths, Cycles, and Uni-Cyclic Graphs -- 3 Cartesian Grids -- References -- A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler -- 1 Introduction -- 2 Preliminaries -- 2.1 Some Properties of Planar Graphs -- 3 Reduction Rules -- 4 The Analysis -- References -- Clustering Performance of 3-Dimensional Hilbert Curves -- 1 Preliminaries -- 2 Clustering Performance of Hilbert Curve Family
  • 2.1 Edge-Cuts of H3 q -Subcurves in Boundary Face-Regions -- 2.2 Edge-Cuts of H3 q -Subcurves in Boundary Edge-Regions -- 2.3 Edge-Cuts of H3 q -Subcurves in Boundary Vertex-Regions -- 3 Total and Mean Numbers of Clusters for Canonical H3 k-Curves, and Verification -- 4 Conclusion -- References -- Broadcast Networks with Near Optimal Cost -- 1 Introduction -- 2 Gm,n Graphs with Minimum Broadcast Time -- 3 Networks with Optimal Cost -- References -- An Optimal Context for Information Retrieval -- 1 Introduction -- 2 Optimal Context -- 2.1 Scenario -- 2.2 Compute of Optimal Context -- 2.3 Optimal Query -- 3 Experiments -- 3.1 Environnement -- 3.2 Results -- 3.3 Analysis -- 4 Conclusion -- References -- An Auction-Bargaining Model for Initial Emission Permits -- 1 Introduction -- 2 The Model -- 3 Auction Stage -- 4 Bargaining Stage -- 5 Conclusion -- References -- Author Index
http://library.link/vocab/cover_art
https://contentcafe2.btol.com/ContentCafe/Jacket.aspx?Return=1&Type=S&Value=9783319079561&userID=ebsco-test&password=ebsco-test
Dimensions
unknown
http://library.link/vocab/discovery_link
{'f': 'http://opac.lib.rpi.edu/record=b4383502'}
Extent
1 online resource (355 pages)
Form of item
online
Isbn
9783319079561
Media category
computer
Media MARC source
rdamedia
Media type code
c
Sound
unknown sound
Specific material designation
remote

Library Locations

    • Folsom LibraryBorrow it
      110 8th St, Troy, NY, 12180, US
      42.729766 -73.682577
Processing Feedback ...