[go: up one dir, main page]

Rodionov et al., 2018 - Google Patents

Reliability polynomials in optimizing placement of base stations in monitoring networks

Rodionov et al., 2018

Document ID
7093332485292054201
Author
Rodionov A
Kalney A
Publication year
Publication venue
2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)

External Links

Snippet

When analysing or designing monitoring networks, one of major indices of quality is a size of area that is under reliable monitoring. This size may be estimated by MENC-a mathematical expectation of a number of nodes that are connected with one special node (central node, C …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
US11989256B2 (en) Method and system for solving the Lagrangian dual of a constrained binary quadratic programming problem using a quantum annealer
Pósfai et al. Controllability of multiplex, multi-time-scale networks
US8117138B2 (en) Method and apparatus for location evaluation and site selection
Agryzkov et al. New highlights and a new centrality measure based on the Adapted PageRank Algorithm for urban networks
EP3053311B1 (en) Systems and methods for distance approximation in graphs
Silva et al. An effective algorithm for computing all‐terminal reliability bounds
Hollanders et al. The complexity of policy iteration is exponential for discounted Markov decision processes
Albin et al. Minimal subfamilies and the probabilistic interpretation for modulus on graphs
CN105184369A (en) Depth learning model matrix compression method and device
Chen et al. Selecting the independent coordinates of manifolds with large aspect ratios
Rodionov et al. Reliability polynomials in optimizing placement of base stations in monitoring networks
Da et al. Estimating the all-terminal signatures for networks by using deep neural network
Gao et al. Categorical structural optimization using discrete manifold learning approach and custom-built evolutionary operators
Huang et al. Adaptive Thouless-Anderson-Palmer approach to inverse Ising problems with quenched random fields
KR101806628B1 (en) Method for constructing fused regression network and fused analysis system thereof
de Lima et al. Node-depth phylogenetic-based encoding, a spanning-tree representation for evolutionary algorithms. Part I: Proposal and properties analysis
Imada Multiple comparison procedures for finding non-maximum normal means
Ortega et al. Distributed slack bus model formulation for the holomorphic embedding load flow method
Gnecco et al. Sparse solutions to the average consensus problem via various regularizations of the fastest mixing Markov-chain problem
Xu et al. Ant colony optimization with three stages for independent test cost attribute reduction
Tallberg Testing centralization in random graphs
Rodionov Some new ideas about obtaining and estimating reliability polynomial of a random graph
He et al. Measuring Component Importance for Network System Using Cellular Automata
Singhal et al. Computing network reliability with imperfect nodes using modified binary decision diagram
Mehrabian Justifying the small‐world phenomenon via random recursive trees