Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

20 articles for “optimality”
Set a search alert
Research ArticleOpen accessIn the abstractOPTIMIZING LOCALIZATION ROUTE USING PARTICLE SWARM-A GENETIC APPROACHL. Lakshmanan, D. C. TomarOne of the most key problems in wireless sensor networks is finding optimal algorithms for sending packets from source node to destination node. Several algorithms exist in literature, since some are in vital role other may not. Since WSN focus on low power consumption during packet transmission and receiving, finally we adopt by merging swarm particle based algorithm with genetic … …American Journal of Applied Sciences, Vol. 11, Issue 3 · 20 Jan 2014 · 7,387 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization of Clock Tree Synthesis Under Stochastic Process Variation Modeling for Multi-FPGA SystemsKarthik Thirumalai Sampath, Jawahar Senthil Kumar VeerabadranIn this age of scientific computing, the experiment models and evaluation is a commonly employed rendition of the simulation methods. In addition to the optimality, the methods which depict underlying uncertainty in process variation. It is accomplished by adjusting number of samples on delay and wire width. Here addresses the thermal profile, if temperature gradually increases, also reduce worst case … …American Journal of Applied Sciences, Vol. 10, Issue 12 · 29 Oct 2013 · 6,518 accessesView PDFCite
Research ArticleOpen accessIn the abstractTHE RATE FUNCTION OF S-MIXING PROCESS AND ITS APPLICATION IN EVALUATING EMPIRICAL LIKELIHOOD TESTSXing WangIn this study we show that the rate function of S-Mixing stationary process with part of the hypermixing condition is equivalent to the Kullback-Leibler distance. This finding can be used to extend the result of the optimality of empirical likelihood test in i.i.d setting to weakly depended case, so that the Asymptotic Relative Efficiency (ARE) of the empirical likelihood test … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 28 Oct 2013 · 6,618 accessesView PDFCite
Research ArticleOpen accessIn the abstractAN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMSRose Al Qasem, Taisir EldosIn modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. … …Journal of Computer Science, Vol. 9, Issue 8 · 25 Jun 2013 · 7,375 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray ValueP. Vishnu Raja, V. Murali BhaskaranProblem statement: Encoding is one of the major factors in genetic algorithms, for a complex problem the optimality for the problem is determined. The encoding mechanism is the initial step which forms the chromosome to form the best fit individuals in the entire population. The proposed method tries to encode the initial population by the binary encoding and by gray … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 28 Jun 2012 · 7,166 accessesView PDFCite
Research ArticleOpen accessIn the abstractArtificial Bee Colony based Energy Aware and Energy Efficient Routing ProtocolP. Visu, S. Koteeswaran, J. JanetProblem statement: Network becomes very important technology in the day to day life style of modern computer era, in which the wireless communication become very popular for the last few years. In the same manner, the other wireless network, i.e., ado network is very popular among the researchers in the past few decades. Approach: The Ad hoc networks are defined … …Journal of Computer Science, Vol. 8, Issue 2 · 19 Jan 2012 · 7,098 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Discrete Event Simulation Framework for Utility Accrual Scheduling Algorithm in Uniprocessor EnvironmentIdawaty Ahmad, Shamala Subramaniam, Mohamed Othman, Zuriati ZulkarnainProblem statement: The heterogeneity in the choice of simulation platforms for real time scheduling stands behind the difficulty of developing a common simulation environment. A Discrete Event Simulation (DES) for a real time scheduling domain encompassing event definition, time advancing mechanism and scheduler has yet to be developed. Approach: The study focused on the proposed and the development of an … …Journal of Computer Science, Vol. 7, Issue 8 · 14 Jul 2011 · 7,227 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Clustering Based Genetic Algorithm for Solving Complex NP ProblemsR. Sivaraj, T. RavichandranProblem statement: The selection process is a major factor in genetic algorithm which determines the optimality of solution for a complex problem. The selection pressure is the critical step which finds out the best individuals in the entire population for further genetic operators. The proposed algorithm tries to find out the best individuals with reduced selection pressure than standard genetic … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,931 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Utility Accrual Scheduling Algorithms for Adaptive Real Time SystemIdawaty Ahmad, Muhammad Fauzan OthmanProblem statement: This study proposed two utility accrual real time scheduling algorithms named as Preemptive Utility Accrual Scheduling (PUAS) and Non-preemptive Utility Accrual Scheduling (NUAS) algorithms. These algorithms addressed the unnecessary abortion problem that was identified in the existing algorithm known as General Utility Scheduling (GUS). It is observed that GUS is inefficient for independent task model because it simply … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 6,356 accessesView PDFCite
Research ArticleOpen accessIn the abstractSemi Strongly E-Convex FunctionsE. A. Youness, T. EmamIn this study a new class of functions, called semi strongly E-convex functions, and generalized semi strongly E-convex functions are defined .We discuss some their basic properties and obtain sufficient optimality criteria for nonlinear programming problems involving these functions. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 31 Mar 2005 · 6,819 accessesView PDFCite