Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An algorithm based on ant colony optimization for the minimum connected dominating set problem
Ant colony optimization is a well established metaheuristic from the swarm intelligence field
for solving difficult optimization problems. In this work we present an application of ant …
for solving difficult optimization problems. In this work we present an application of ant …
The generalized regenerator location problem
In an optical network a signal can only travel a maximum distance d max before its quality
deteriorates to the point that it must be regenerated by installing regenerators at nodes of the …
deteriorates to the point that it must be regenerated by installing regenerators at nodes of the …
A Greedy Simulated Annealing-based Multiobjective Algorithm for the Minimum Weight Minimum Connected Dominating Set Problem
The minimum connected dominating set problem is a well-known NP-hard combinatorial
optimization problem in graph theory, with various fields of application including wireless …
optimization problem in graph theory, with various fields of application including wireless …
Optimal regenerator placement in translucent optical networks
The distance an optical signal can travel, before its quality degrades to a level that requires
3R-regeneration, is called the optical reach. In a translucent optical network, if an optical …
3R-regeneration, is called the optical reach. In a translucent optical network, if an optical …
A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem
Minimum connected dominating set problem is an NP-hard combinatorial optimization
problem in graph theory. Finding connected dominating set is of high interest in various …
problem in graph theory. Finding connected dominating set is of high interest in various …
Improved NSGA-II for minimum weight minimum connected dominating set problem
Most real-world problems are multiobjective in nature and considerable research efforts
have been devoted to propose efficient multiobjective optimization approaches …
have been devoted to propose efficient multiobjective optimization approaches …
Placing regenerators in optical networks to satisfy multiple sets of requests
The placement of regenerators in optical networks has become an active area of research
during the last few years. Given a set of lightpaths in a network G and a positive integer d …
during the last few years. Given a set of lightpaths in a network G and a positive integer d …
On regenerator site selection in translucent optical network design
PK Nath, T Venkatesh - Photonic Network Communications, 2022 - Springer
In a dynamically reconfigurable wide-area translucent network, the pre-deployment of
regenerators at few sites has its advantages due to the increased system optimization and …
regenerators at few sites has its advantages due to the increased system optimization and …
Optimal regenerator placement in survivable translucent networks
Q Rahman, Y Aneja… - … Conference on the …, 2014 - ieeexplore.ieee.org
In optical networks, the optical reach is defined as the distance an optical signal can travel,
before its quality degrades to a level that requires 3R-regeneration. In a translucent optical …
before its quality degrades to a level that requires 3R-regeneration. In a translucent optical …
On static RWA in translucent optical networks
Q Rahman, S Bandyopadhyay… - 2012 IEEE Symposium …, 2012 - ieeexplore.ieee.org
The distance an optical signal can travel before the signal quality degrades to a level that
necessitates regeneration is called the optical reach. To establish a lightpath of length …
necessitates regeneration is called the optical reach. To establish a lightpath of length …