نتایج جستجو برای: optimum strategy
تعداد نتایج: 406780 فیلتر نتایج به سال:
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
Refactoring, as an XP practice, aims to improve the design of existing code to cope with foreseen software architecture evolution. The selection of the optimum refactoring strategy can be a daunting task involving the identification of refactoring candidates, the determination of which refactorings to apply and the assessment of the refactoring impact on software product quality characteristics...
A non-regenerative dual-hop wireless system based on a distributed space-time-coding strategy is considered. It is assumed that each relay station retransmits an appropriate scaled space-time coded version of the received signals. The main goal of this paper is to provide an analytical study of an optimum power allocation strategy in relay stations in order to satisfy the quality of service req...
Cell-free synthetic biology system organizes multiple enzymes (parts) from different sources to implement unnatural catalytic functions. Highly adaption between the catalytic parts is crucial for building up efficient artificial biosynthetic systems. Protein engineering is a powerful technology to tailor various enzymatic properties including catalytic efficiency, substrate specificity, tempera...
Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries
In the game theory literature, there is an intriguing line of research on the problem of playing a repeated matrix game against an adversary whose computational resources are limited in some way. Perhaps the main way in which this research differs from classical game theory lies in the fact that when our adversary is not playing the minimax optimal strategy for the game, we may be able to attai...
The optimum design of the heat sink by using differential evolution (DE) method is discussed in the present paper. The DE strategy (DE/ best/ 1/exp) is used here because this strategy is best strategy for heat transfer applications [1]. The main procedures for the heat sink optimization is found the minimum thermal resistance (maximize the heat transfer per unit volume) of the heat sink in orde...
Aiming at the defects of fast convergence speed lion swarm algorithm and easy to fall into local optimum, a variable-speed elastic collision (VELSO) is proposed. Firstly, flexibility lioness search increased according variable spiral strategy, then two lionesses learn learning strategies teaching algorithms enhance interactive behavior hunting. Then, improved refraction reverse strategy used in...
Since the advent of evolution strategies many attempts have been done to improve the mutation operator [7]. The first enhancement could be seen in the introduction of a flexible step size. As a logical consequence later n step sizes, one per variable, were used. Highest flexibility is achieved with the correlated mutation but also quadratic growth of the number of strategy parameters [8]. A new...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید