[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Elshqeirat et al., 2014 - Google Patents

Topology design with minimal cost subject to network reliability constraint

Elshqeirat et al., 2014

View PDF
Document ID
2396952255880070595
Author
Elshqeirat B
Soh S
Rai S
Lazarescu M
Publication year
Publication venue
IEEE Transactions on Reliability

External Links

Snippet

This paper addresses an NP-hard problem, referred to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. The paper …
Continue reading at espace.curtin.edu.au (PDF) (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
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • 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
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Elshqeirat et al. Topology design with minimal cost subject to network reliability constraint
Ho et al. Simple explanation of the no-free-lunch theorem and its implications
Oda et al. Evaluation of WMN-GA for different mutation operators
Ho et al. Simple explanation of the no free lunch theorem of optimization
Guha et al. Distributed partial clustering
Mehrpouyan et al. Resiliency analysis for complex engineered system design
Mezić et al. Spectral complexity of directed graphs and application to structural decomposition
Larsson 5G networks: planning, design and optimization
Saeed et al. Toward reliable controller placements in software-defined network using constrained multi-objective optimization technique
Nejad et al. Using memetic algorithms for test case prioritization in model based software testing
Sarmasarkar et al. On gradient coding with partial recovery
Xu et al. Traversing the local polytopes of relu neural networks: A unified approach for network verification
KR101609457B1 (en) Method for searching median node in big graph database based on low boundary
Forghani-elahabad et al. A simple improved algorithm to find all the lower boundary points in a multiple-node-pair multistate flow network
Abbas et al. Evolutionary based set covers algorithm with local refinement for power aware wireless sensor networks design
Shibata et al. A learning method for dynamic Bayesian network structures using a multi-objective particle swarm optimizer
Kim et al. Bicriteria network design using a spanning tree-based genetic algorithm
Mohtavipour et al. A large-scale application mapping in reconfigurable hardware using deep graph convolutional network
Elshqeirat et al. Dynamic programming for minimal cost topology with two terminal reliability constraint
Wang et al. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning
Husák et al. Lightweight Impact Assessment and Projection of Lateral Movement and Malware Infection
Mahmood et al. Reliability evaluation using a clustering technique based on tie-set method
Elshqeirat Optimizing reliable network topology design using dynamic programming
Li et al. Improving centralized path calculation based on graph compression
CN115665025B (en) Method, device, equipment and storage medium for detecting key node sequence of inter-domain routing system