標(biāo)題: Titlebook: Computational Aspects and Applications in Large-Scale Networks; NET 2017, Nizhny Nov Valery A. Kalyagin,Panos M. Pardalos,Irina Utkina Conf [打印本頁(yè)] 作者: 投射技術(shù) 時(shí)間: 2025-3-21 17:55
書目名稱Computational Aspects and Applications in Large-Scale Networks影響因子(影響力)
書目名稱Computational Aspects and Applications in Large-Scale Networks影響因子(影響力)學(xué)科排名
書目名稱Computational Aspects and Applications in Large-Scale Networks網(wǎng)絡(luò)公開度
書目名稱Computational Aspects and Applications in Large-Scale Networks網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Aspects and Applications in Large-Scale Networks被引頻次
書目名稱Computational Aspects and Applications in Large-Scale Networks被引頻次學(xué)科排名
書目名稱Computational Aspects and Applications in Large-Scale Networks年度引用
書目名稱Computational Aspects and Applications in Large-Scale Networks年度引用學(xué)科排名
書目名稱Computational Aspects and Applications in Large-Scale Networks讀者反饋
書目名稱Computational Aspects and Applications in Large-Scale Networks讀者反饋學(xué)科排名
作者: Fulminate 時(shí)間: 2025-3-21 23:59
FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems matrices included in the problems’ formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included in the problem formulation. Additionally, we present FPT algorithms with respect to the same main parameter for the problems, when the matrices have 作者: 顯而易見 時(shí)間: 2025-3-22 01:32 作者: 疲勞 時(shí)間: 2025-3-22 06:11 作者: 都相信我的話 時(shí)間: 2025-3-22 12:03 作者: 嘲弄 時(shí)間: 2025-3-22 13:47 作者: 嘲弄 時(shí)間: 2025-3-22 20:57 作者: Graphite 時(shí)間: 2025-3-23 01:05 作者: flex336 時(shí)間: 2025-3-23 04:00
Robust Statistical Procedures for Testing Dynamics in Market Networkmarket network. In the present paper, the stock market network of stock’s returns is considered. Probability of sign coincidence of stock’s returns is used as the measure of similarity between stocks. Robust (distribution free) multiple testing statistical procedure for testing dynamics of network i作者: 單片眼鏡 時(shí)間: 2025-3-23 06:19 作者: 冰雹 時(shí)間: 2025-3-23 10:32
Selective Bi-coordinate Variations for Network Equilibrium Problems with Mixed Demandhod is based on the equilibrium conditions of the problem under consideration. It uses a special tolerance control and thresholds for constructing descent directions and a variant of the Armijo-type line-search procedure as a rule of step choice. Some results of preliminary numerical calculations wh作者: 策略 時(shí)間: 2025-3-23 15:47
Developing a Model of Topological Structure Formation for Power Transmission Grids Based on the Analssia’s power transmission grid is used in the paper as a source of empirical data about power grids topology. As a result of the analysis, we get a conclusion that universal models of complex network theory are not applicable to the UNEG modelling. Nevertheless, the creation of a compound model, whi作者: bronchodilator 時(shí)間: 2025-3-23 20:04 作者: 公式 時(shí)間: 2025-3-23 23:55
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Searchis case, the search of the closest object can be thought as a search of a node in a network. A procedure in a network is called decentralized, if it uses only local information about visited nodes and its neighbors. Networks, which structure allows efficient performing the nearest neighbor search by作者: 窒息 時(shí)間: 2025-3-24 04:29 作者: COWER 時(shí)間: 2025-3-24 07:47
Rejection Graph for Multiple Testing of Elliptical Model for Market Networkf stock market returns. The question of adequacy in this model to real market data is open. There are known results that reject such model and at the same time, there are results that approve such model. Obtained results are concerned to testing some properties of elliptical model. In the paper, ano作者: eczema 時(shí)間: 2025-3-24 11:27 作者: Interlocking 時(shí)間: 2025-3-24 18:54
Dispositional Power and 5G Standardsfunction minimizes the sum of travel costs, fixed vehicle costs, and penalties for soft time window violations. The algorithm is based on the tabu search with several neighborhoods. The main contribution of the paper is the efficient algorithm for a real-life vehicle routing problem. To the best of 作者: 發(fā)炎 時(shí)間: 2025-3-24 21:52
https://doi.org/10.1007/978-3-031-15467-6 matrices included in the problems’ formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included in the problem formulation. Additionally, we present FPT algorithms with respect to the same main parameter for the problems, when the matrices have 作者: perjury 時(shí)間: 2025-3-24 23:55
Structural Power in the Global Ageparative analysis of classifier fusion algorithms to aggregate decisions for individual frames. We implemented the video-based recognition system with several aggregation methods to improve the age and gender identification accuracy. The experimental comparison of the proposed approach with traditio作者: 易達(dá)到 時(shí)間: 2025-3-25 03:56
The Nature of Globality and Its Logicof . such that every cycle of 3 vertices in . contains at least one vertex from .. We consider a hereditary class graphs which has the following property. The maximum cardinality of a triangle packing is equal to the minimum cardinality of a triangle vertex cover. In this paper we present some minim作者: ARK 時(shí)間: 2025-3-25 07:43 作者: 使聲音降低 時(shí)間: 2025-3-25 14:16 作者: 同謀 時(shí)間: 2025-3-25 19:08 作者: fodlder 時(shí)間: 2025-3-25 20:28 作者: indecipherable 時(shí)間: 2025-3-26 03:32 作者: LIEN 時(shí)間: 2025-3-26 05:36 作者: 極深 時(shí)間: 2025-3-26 12:25 作者: 高度 時(shí)間: 2025-3-26 13:52 作者: hieroglyphic 時(shí)間: 2025-3-26 18:47
The Search for Structural Power of methods of vector estimates comparison by preference using various types of information about the preferences of the decision-maker is given. These methods are implemented in the computer system DASS.作者: 和音 時(shí)間: 2025-3-26 23:18
The Search for Structural Poweris case, the search of the closest object can be thought as a search of a node in a network. A procedure in a network is called decentralized, if it uses only local information about visited nodes and its neighbors. Networks, which structure allows efficient performing the nearest neighbor search by作者: Latency 時(shí)間: 2025-3-27 01:14
https://doi.org/10.1007/978-3-031-15467-6f activation and deactivation of collectives, represented by networks, by establishing special agents called activators and deactivators in a network. Such problems are combinatorial and to solve them, we employ the algorithms for solving Boolean satisfiability problem (SAT). Thus, we describe the g作者: Confirm 時(shí)間: 2025-3-27 05:32
Structural Power in the Global Agef stock market returns. The question of adequacy in this model to real market data is open. There are known results that reject such model and at the same time, there are results that approve such model. Obtained results are concerned to testing some properties of elliptical model. In the paper, ano作者: 地名詞典 時(shí)間: 2025-3-27 10:51
Structural Power in the Global Agear research in social sciences. Four levels that determine a design of the research can be established: ontological and epistemological assumptions that determine what is the reality under the study and how can we obtain the knowledge about it; a general methodological frame that defines the object 作者: 半球 時(shí)間: 2025-3-27 14:22
Computational Aspects and Applications in Large-Scale Networks978-3-319-96247-4Series ISSN 2194-1009 Series E-ISSN 2194-1017 作者: forestry 時(shí)間: 2025-3-27 18:53
https://doi.org/10.1007/978-3-031-15467-6 matrices included in the problems’ formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included in the problem formulation. Additionally, we present FPT algorithms with respect to the same main parameter for the problems, when the matrices have no singular rank sub-matrices.作者: 外形 時(shí)間: 2025-3-27 23:26
The Search for Structural Power of methods of vector estimates comparison by preference using various types of information about the preferences of the decision-maker is given. These methods are implemented in the computer system DASS.作者: insipid 時(shí)間: 2025-3-28 02:20
FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems matrices included in the problems’ formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included in the problem formulation. Additionally, we present FPT algorithms with respect to the same main parameter for the problems, when the matrices have no singular rank sub-matrices.作者: BADGE 時(shí)間: 2025-3-28 09:02
Methods of Criteria Importance Theory and Their Software Implementation of methods of vector estimates comparison by preference using various types of information about the preferences of the decision-maker is given. These methods are implemented in the computer system DASS.作者: 表狀態(tài) 時(shí)間: 2025-3-28 10:52 作者: 侵害 時(shí)間: 2025-3-28 16:58
Springer Proceedings in Mathematics & Statisticshttp://image.papertrans.cn/c/image/232113.jpg作者: BILL 時(shí)間: 2025-3-28 21:58
https://doi.org/10.1007/978-3-319-96247-4Computational Aspects and Applications of Large Scale Networks; Critical Links; Autoregressive Models; 作者: 代替 時(shí)間: 2025-3-29 02:02
978-3-030-07163-9Springer International Publishing AG, part of Springer Nature 2018作者: Chipmunk 時(shí)間: 2025-3-29 03:15 作者: 性滿足 時(shí)間: 2025-3-29 08:31
The Illusion of “The Clean Network” one of them is convex separable, whereas the feasible set is the corresponding Cartesian product. We discuss some versions of the partial linearization method, which can be applied to these network equilibrium problems.作者: 參考書目 時(shí)間: 2025-3-29 12:30
https://doi.org/10.1007/978-3-031-15467-6ation. We give a number of theoretical properties of corresponding discrete dynamical systems. For the problems of blocking attacks on computer networks, the corresponding reduction to SAT was implemented and tested. At the present moment using state-of-the-art SAT solvers, it is possible to solve such problems for networks with 200 vertices.作者: HAIRY 時(shí)間: 2025-3-29 16:54
Structural Power in the Global Ageual hypotheses for multiple testing. Uniformly, most powerful tests of Neyman structure are constructed for individual hypotheses testing. Associated step-wise multiple testing procedure is applied for the real market data. The main result is that under some conditions tail symmetry hypothesis is not rejected.作者: 小爭(zhēng)吵 時(shí)間: 2025-3-29 22:21 作者: Aggregate 時(shí)間: 2025-3-30 02:34 作者: 遺產(chǎn) 時(shí)間: 2025-3-30 06:25 作者: adipose-tissue 時(shí)間: 2025-3-30 08:53 作者: extemporaneous 時(shí)間: 2025-3-30 13:46
The Search for Structural Powering. In the experimental study with the YTF dataset, we examined several ways to aggregate features of individual frame in order to obtain descriptor of the whole video track. It was demonstrated that the most accurate and fast algorithm is the matching of normalized average feature vectors.作者: 陪審團(tuán)每個(gè)人 時(shí)間: 2025-3-30 19:53 作者: 攀登 時(shí)間: 2025-3-31 00:06 作者: 大暴雨 時(shí)間: 2025-3-31 01:03
Structural Power in the Global Agell these levels are interrelated, sometimes in very confusing way. We propose to extract a preliminary set of relations between various elements from textbooks on methodology of social and political sciences and to visualize and analyze their relations using network analytic methods.作者: 遣返回國(guó) 時(shí)間: 2025-3-31 06:52 作者: ellagic-acid 時(shí)間: 2025-3-31 10:21
Mapping Paradigms of Social Sciences: Application of Network Analysisll these levels are interrelated, sometimes in very confusing way. We propose to extract a preliminary set of relations between various elements from textbooks on methodology of social and political sciences and to visualize and analyze their relations using network analytic methods.作者: 沒花的是打擾 時(shí)間: 2025-3-31 14:24 作者: DEAF 時(shí)間: 2025-3-31 20:04
The Nature of Globality and Its Logicrty. The maximum cardinality of a triangle packing is equal to the minimum cardinality of a triangle vertex cover. In this paper we present some minimal forbidden induced subgraphs for this hereditary class.
