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

420 results for “Complexity”
Set a search alert
Research ArticleOpen accessIn the keywordsSolving the Periodic Maintenance Scheduling Problem via Genetic Algorithm to Balance Workforce Levels and Maintenance CostMohamed Ali Abdel-Fattah MansourProblem statement: In this article we address the multi-objective Periodic Maintenance Scheduling Problem (PMSP) of scheduling a set of cyclic maintenance operations for a given set of machines through a specified planning period to minimize the total variance of workforce levels measured in man-hours and maintenance costs with equal weights. Approach: The article proposed a mixed integer non-linear math programming … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 2 · 12 Jul 2011 · 8,317 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDesign Dynamic Coupling Measurement of Distributed Object Oriented Software Using Trace EventsS. Babu, R. M.S. ParvathiProblem statement: A common way to define and measure coupling is through structural properties and static code analysis. However, because of polymorphism, dynamic binding and the common presence of unused code in commercial software, the resulting coupling measures are imprecise as they do not perfectly reflect the actual coupling taking place among classes at run-time. For example, when using static … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,934 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA New Scalable and Reliable Cost Effective Key Agreement Protocol for Secure Group CommunicationS. Jabeen Begum, Dr. T. PurusothamanProblem statement: In a heterogeneous environment, for a secure multicast communication, the group members have to share a secret key which is used to encrypt/decrypt the secret messages among the members. The Secure Group Communication of large scale multicast group in a dynamic environment is more complex than securing one-to-one communication due to the inherent scalability issue of group key … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 6,960 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSorting N-Elements Using Natural Order: A New Adaptive Sorting ApproachShamim Akhter, M. Tanveer HasanProblem statement: Researchers focused their attention on optimally adaptive sorting algorithm and illustrated a need to develop tools for constructing adaptive algorithms for large classes of measures. In adaptive sorting algorithm the run time for n input data smoothly varies from O(n) to O(nlogn), with respect to several measures of disorder. Questions were raised whether any approach or technique would … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,722 accessesView PDFCite
Research ArticleOpen accessIn the keywordsComparative Performance Study of Improved Heap Sort Algorithm on Different HardwareVandana Sharma, Satwinder Singh, K. S. KahlonProblem statement: Several efficient algorithms were developed to cope with the popular task of sorting. Improved heap sort is a new variant of heap sort. Basic idea of new algorithm is similar to classical Heap sort algorithm but it builds heap in another way. The improved heap sort algorithm requires nlogn-0.788928n comparisons for worst case and nlogn-n comparisons in average … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 6,824 accessesView PDFCite
Research ArticleOpen accessIn the keywordsThe Coordinated Scheduling Support System of Production and DeliveryMing-Feng Yang, Yi LinProblem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing … …American Journal of Applied Sciences, Vol. 6, Issue 4 · 30 Apr 2009 · 6,798 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSimulation of Parallel Logical Operations with Biomolecular ComputingMahnaz Kadkhoda, Ali A. PouyanBiomolecular computing is the computational method that uses the potential of DNA as a parallel computing device. DNA computing can be used to solve NP-complete problems. An appropriate application of DNA computation is large-scale evaluation of parallel computation models such as Boolean Circuits. In this study, we present a molecular-based algorithm for evaluation of Nand-based Boolean Circuits. The contribution of … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 6,687 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMeasurement of Software Maintainability Using a Fuzzy ModelK. K. Aggarwal, Yogesh Singh, Pravin Chandra, Manimala PuriSoftware maintenance is a task that every development group has to face when the software is delivered to the customers' site, installed and is operational. The time spent and effort required for keeping software operational consumes about 40-70% of cost of entire life cycle. This study proposes a four parameter integrated measure of software maintainability using a fuzzy model. The … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,957 accessesView PDFCite
Research ArticleOpen accessIn the keywordsDesigning a Portlet for Plagiarism Detections Within a Campus PortalJinan A.W. Fiaidhi, Zuhoor AlKhanjari, Sabah M.A. Mohammed, Raiya Al-HinaiIn an educational context, we are faced with similar challenges. How do we keep the administration, faculty, staff and students well informed about institutional policies and procedures? How do we ensure the student body receives accurate and up-to-date information to help them achieve their educational and career goals? How to check for plagiarism cases? In addition, we hope to build … …Journal of Computer Science, Vol. 1, Issue 1 · 31 Mar 2005 · 6,759 accessesView PDFCite
Review ArticleOpen accessIn the abstractA Comprehensive Review of Post-Quantum Cryptography AlgorithmsSamandeep Kaur, Jaswinder SinghThe development of quantum computing has been rapid, and an existential threat to computational hardness assumptions that underlie today's public-key cryptography has been encountered. This manuscript is a complete and thoroughly organized review of Post-Quantum Cryptography (PQC), discussing the mathematical concepts, complexity, and mechanisms of the algorithms that underpin quantum-safe security infrastructures. Rather than the principles of quantum mechanics, the … …Journal of Computer Science, Vol. 22, Issue 9 · 25 Sep 2026 · 723 accessesView PDFCite