Models, Algorithms and Technologies for Network Analysis

Models, Algorithms and Technologies for Network Analysis

NET 2014, Nizhny Novgorod, Russia, May 2014

Kalyagin, Valery A.; Koldanov, Petr A.; Pardalos, Panos M.

Springer International Publishing AG

06/2018

340

Mole

Inglês

9783319806075

15 a 20 dias

545

Descrição não disponível.
Part I: Optimization in Networks.- Maximally Diverse Grouping and Clique Partitioning Problems with Skewed General Variable Neighborhood Search.- Test Generation for Digital Circuits Based on Continuous Approach to Circuit Simulation Using Different Continuous Extensions of Boolean Functions.- Koenig graphs for 4-paths. Wided cycles.- Optimization Algorithms for Shared Groups in Multicast Routing.- Minimizing the Fuel Consumption of a Multiobjective Vehicle Routing Problem Using the Parallel Multi-Start NSGA II Algorithm.- Manifold Location Routing Problem with Applications in Network Theory.- A Branch and Bound Algorithm for the Cell Formation Problem.- Part II: Network Data Mining.- Hybrid Community Detection in Social Networks.- Spectral Properties of Financial Correlation Matrices.- Statistical Uncertainty of Minimum Spanning Tree in Market Network.- Identi?cation of Cliques and Independent Sets in Pearson and Fechner Correlations Networks.- Testing the Stationarity of Sign Coincidence in Market Network.- Synchronization and Network Measures in a Concussion EEG Paradigm.- Video-Based Pedestrian Detection on Mobile Phones with the Cascade Classifiers.- Clustering in Financial Markets.- Part III: Economics and Other Applications.- A Semantic Solution for Seamless Data Exchange in Supply Networks.- Key Borrowers Detected by the Intensities of Their Short-Range Interactions.- Langmuir Solitons in Plasma with Inhomogeneous Electron Temperature and Space Stimulated Scattering on Damping Ion-sound Waves.- Equilibria in Networks with Production and Knowledge Externalities.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Complex networks;Steiner forest;coloring problem;heuristics;maximum cliques;network analysis;combinatorics