Author details
Author's Published Works
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Author details
Showing 1-25 of 1,831 resultsfor "Index Terms":Worst-case Time Complexity
"Index Terms":Worst-case Time Complexity
- Sort
Filter Results
Show
Sort By
Results
Super Sort Sorting Algorithm
2018 3rd International Conference for Convergence in Technology (I2CT)
Year: 2018 | Conference Paper |
Cited by: Papers (5)
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms. The sorting technique presented in this paper makes use of the natural sequence of sorted elements in an arra...Show More
An Advanced Firewall Rule Matching Algorithm
2018 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)
Year: 2018 | Conference Paper |
Cited by: Papers (2)
The importance of internal network security has been on the rise due to the demand of businesses in organizations that deal complicated device connections in SCADA networks. Ideally, the firewall rule searching speed must be as effective as O(1) time complexity, to filter all network traffic regardless of the number of fields filtered and the number of firewall rules. This paper proposes an advanc...Show More
An Efficient Nondominated Sorting Algorithm for Large Number of Fronts
IEEE Transactions on Cybernetics
Cited by: Papers (29)
Nondominated sorting is a key operation used in multiobjective evolutionary algorithms (MOEA). Worst case time complexity of this algorithm is O(MN2), where N is the number of solutions and M is the number of objectives. For stochastic algorithms like MOEAs, it is important to devise an algorithm which has better average case performance. In this paper, we propose a new algorithm that makes use of...Show More
DDA-ENS: Dominance Degree Approach based Efficient Non-dominated Sort
2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
Year: 2020 | Conference Paper |
In Pareto based multi- and many-objective evolutionary algorithms (MOEAs and MaOEAs), non-dominated sorting is an important step that divides the set of solutions into different disjoint non-dominated fronts. In the last 20 years, there have been various approaches proposed for non-dominated sorting. Recently, an approach known as Dominance Degree Approach for Non-Dominated Sorting (DDA-NS) has be...Show More
A New Algorithm to Compute Single Source Shortest Path in a Real Edge Weighted Graph to Optimize Time Complexity
Fahim Ahmed;Fahim Anzum;Muhammad Nazrul Islam;Wali Mohammad Abdullah;Sazid Al Ahsan;Moneruzzaman Rana
2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)
Year: 2018 | Conference Paper |
Cited by: Papers (3)
A prime concern of a Shortest-Path problem is to handle any real edge weight values whether it is positive or negative with the feature of negative weight cycle detection if exists. Number of single source shortest-path algorithms are available that can handle negative weight cycle, where the most stable algorithm till date executes with polynomial time complexity. In this paper, an algorithm is p...Show More
Efficient bandwidth utilization using reserved bits of transmission control protocol header
2nd Smart Cities Symposium (SCS 2019)
Year: 2019 | Conference Paper |
Internet has in a glimmer formed into a tremendous overall framework in the creating development. Transmission Control Protocol Suite is the major need for the time being's Internet. The exponential growth in the usage of the web can be easily observed. The Transmission Control Protocol suite has numerous arrangement deficiencies so far as Bandwidth use, Exchange Speed and congestion over the netw...Show More
Efficient bandwidth utilization using reserved bits of transmission control protocol header
Year: 2019 | Conference Paper |
An Experimental Comparison of Implementations of Dijkstra’s Single Source Shortest Path Algorithm Using Different Priority Queues Data Structures
2020 24th International Conference on System Theory, Control and Computing (ICSTCC)
Year: 2020 | Conference Paper |
Cited by: Papers (2)
We compare multiple implementations of Dijkstra's single source shortest paths algorithm using two different data structures. The algorithms are implemented in Python programming language and the test data consisted of graphs with 1,000 vertices and up to 900,000 edges, split into sparse and dense graphs. These implementations have different theoretical time orders of complexity and the experiment...Show More
Analysis of Comparison-Based Sorting Algorithms
Zainab Inayat;Rabia Sajjad;Marrium Anam;Alisha Younas;Muzammil Hussain
2021 International Conference on Innovative Computing (ICIC)
Year: 2021 | Conference Paper |
Cited by: Papers (2)
With the expansion of computing, random and unorder data on the internet is also increasing. The searching of useful information from this scattered data has become a critical problem. To solve this problem, researchers has devoted a lot of efforts by developing new approaches and algorithms. They are still working on it to improve the results to be more efficient, fast, and reliable. Sorting is a...Show More
Predictable Worst-Case Execution Time Analysis for Multiprocessor Systems-on-Chip
2011 Sixth IEEE International Symposium on Electronic Design, Test and Application
Year: 2011 | Conference Paper |
Cited by: Papers (3)
Worst-case execution time analysis is the fundament of real-time system design, and is therefore an area which has been subject to great scientific interest for a long time. However, traditional worst-case execution time analysis techniques assume that the underlying hardware is a monoprocessor system, and this class of hardware platforms is getting less suitable for modern embedded applications, ...Show More
Merge sort enhanced in place sorting algorithm
2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT)
Year: 2016 | Conference Paper |
Cited by: Papers (2)
This paper aims at introducing a new sorting algorithm which sorts the elements of an array In Place. This algorithm has O(n) best case Time Complexity and O(n log n) average and worst case Time Complexity. We achieve our goal using Recursive Partitioning combined with In Place merging to sort a given array. A comparison is made between this particular idea and other popular implementations. We fi...Show More
QB Sort:An Efficient computational Algorithm for advance networks
2018 3rd International Conference On Internet of Things: Smart Innovation and Usages (IoT-SIU)
Year: 2018 | Conference Paper |
It is known that sorting is basic problem in computer science. In current scenario, different protocols and routing algorithms are used in advance networks. Sorting plays an important role in networking protocols. Selective repeat flow control protocol use sorting algorithm at receiver side. An efficient and effective sorting algorithm is needed for SR protocol to improve its performance. This pap...Show More
Big-O Time Complexity Analysis Of Algorithm
2022 International Conference on Signal and Information Processing (IConSIP)
Year: 2022 | Conference Paper |
Cited by: Papers (6)
Time complexity describes the amount of time taken by the computer to run a code by counting the number of operations performed in an algorithm. Algorithms with optimistic logic tend to have less time complexity. Usually, the time complexity is computed theoretically or mathematically. Big O notation describes the worst-case time complexity of the algorithm using algebraic terms. This work calcula...Show More
A Review of Algorithms’s Complexities on Different Valued Sorted and Unsorted Data
Attia Shabbir;Asad Majeed;Mahnoor Iftikhar;Raja Hashim Ali;Usama Arshad;Muhammad Zeeshan Shabbir;Ali Zeeshan Ijaz;Nisar Ali;Ali Aftab
2023 International Conference on IT and Industrial Technologies (ICIT)
Year: 2023 | Conference Paper |
Cited by: Papers (4)
Sorting and searching are critical processes for effecttive data analysis. In this paper, we evaluate the performance of various sorting and searching algorithms and compare their time and space complexities on both sorted and unsorted data. The algorithms we analyzed include six common sorting algorithms (insertion, radix, bucket, merge, bubble, and quick sort) and three search algorithms (linear...Show More
Single Channel EEG for Near Real-Time Sleep Stage Detection
2019 International Conference on Computational Science and Computational Intelligence (CSCI)
Year: 2019 | Conference Paper |
Cited by: Papers (7)
Sleep disorders are considered as one of the major human life issues in the recent years. Therefore, efficient and automated systems that can differentiate sleep stages and assist physicians/neurologists in the diagnosis and treatment of sleep-related disorders, are highly on demand. The present paper is devoted to developing an easy-to-implement sleep stage classification algorithm that works fas...Show More
A study on Fibonacci series generation algorithms
2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS)
Year: 2016 | Conference Paper |
Cited by: Papers (1)
many algorithms proposed to generate Fibonacci series introduced by a 12th century Italian mathematician Leonardo Bonacci [1]. The study paper gives insight into three different Fibonacci series generation algorithms. This paper compares and contrasts three different algorithms namely LINEAR_FIB, EXPO_FIB and MATRIX_FIB. Time complexities of these algorithms are computed. The results of our study ...Show More
A Seemingly Polynomial-Time Algorithm for Optimal Curve Fitting by Segmented Straight Lines
2018 IEEE Conference on Decision and Control (CDC)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
We consider least-squares approximation of a function of one variable by a continuous, piecewise-linear approxim-and that has a small number of breakpoints. This problem was notably considered by Bellman who proposed an approximate algorithm based on dynamic programming. Many suboptimal approaches have been suggested, but so far, the only exact methods resort to mixed integer programming with supe...Show More
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach
2023 IEEE International Conference on Big Data (BigData)
Year: 2023 | Conference Paper |
Extensive research has been conducted on rough set theory, specifically focusing on the study of decision trees (DTs) and decision rule systems (DRSs). This theory addresses several important questions, including the relationship between DTs and DRSs, the tradeoff between time and space for DTs, and the tradeoff for DRSs.The objective of this paper is to investigate infinite binary information sys...Show More
Learning-Based Response Time Analysis in Real-Time Embedded Systems: A Simulation-Based Approach
Mahshid Helali Moghadam;Mehrdad Saadatmand;Markus Borg;Markus Bohlin;Björn Lisper
2018 IEEE/ACM 1st International Workshop on Software Qualities and their Dependencies (SQUADE)
Year: 2018 | Conference Paper |
Cited by: Papers (1)
Response time analysis is an essential task to verify the behavior of real-time systems. Several response time analysis methods have been proposed to address this challenge, particularly for real-time systems with different levels of complexity. Static analysis is a popular approach in this context, but its practical applicability is limited due to the high complexity of the industrial real-time s...Show More
Hypervolume by Slicing Objective Algorithm: An Improved Version
Sumit Mishra;Srinibas Swain;Sangita Sarmah;Carlos A. Coello Coello
2021 IEEE Congress on Evolutionary Computation (CEC)
Year: 2021 | Conference Paper |
The hypervolume remains a popular performance indicator in evolutionary multi-objective, mainly because of its nice mathematical properties (i.e., it’s the only performance indicator known to be Pareto-compliant). However, its high computational cost (which grows polynomially on the population size but exponentially on the number of objectives) has severely limited its use in many-objective optimi...Show More
A Faster Approach for Robust Set Stabilization of Boolean Control Networks
2023 42nd Chinese Control Conference (CCC)
Year: 2023 | Conference Paper |
This paper presents new methods on robust set invariance, set stabilizability, and set stabilization of Boolean control networks (BCNs) subject to arbitrary disturbance inputs. We approach these problems from a novel algorithmic perspective and develop more efficient algorithms that scale to moderately large networks. The predecessor concept in graph theory is first generalized to a robust predece...Show More
Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint
Only when we understand how hackers think, can we defend against their attacks. Towards this end, this paper studies the cyber-attacks that aim to remove nodes or links from network topologies. We particularly focus on one type of such attacks called Maximum Vertex Coverage Attacks under Knapsack constraint (MVCAK), in which a hacker has a fixed budget to remove nodes from a network with the nodes...Show More
Comparative Analysis of Sorting Algorithms: Time Complexity and Practical Applications
2025 3rd International Conference on Intelligent Data Communication Technologies and Internet of Things (IDCIoT)
Year: 2025 | Conference Paper |
In the field of computer science, sorting algorithms are crucial because they facilitate the effective processing and arrangement of data in a variety of scenarios, including data analysis, searching, and optimal system operation. The objective of this study is to look at and compare different sorting algorithms to see how well they work and how useful they are in different situations. The study t...Show More
Timing Analysis for TDMA Arbitration in Resource Sharing Systems
2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Year: 2010 | Conference Paper |
Cited by: Papers (69)
Modern computing systems have adopted multicore architectures and multiprocessor systems on chip (MPSoCs) for accommodating the increasing demand on computation power. However, performance boosting is constrained by shared resources, such as buses, main memory, DMA, etc.This paper analyzes the worst-case completion (response) time for real-time tasks when time division multiple access (TDMA) polic...Show More
Comparative Analysis of Binary and Interpolation Search Algorithms on Integer Data Using C Programming Language
Bima Andri Saputra;Stevans Calvin Candra;Franis Berta Wijaya;Kristien Margi Suryaningrum;Hanis Amalia Saputri
2023 International Conference on Information Management and Technology (ICIMTech)
Year: 2023 | Conference Paper |
Cited by: Papers (1)
To perform data search, there are various algorithms that have been developed, such as binary search and interpolation search. There are various views on these two algorithms, regarding which one is better than the other. From the various views that have emerged, this study aims to find out which algorithm is more efficient in terms of time complexity and memory complexity using Big-O notation, as...Show More
A Novel Community Detection Method for Collaborative Networks
2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)
Year: 2018 | Conference Paper |
Cited by: Papers (6)
Community structure prevails in network graphs like social networks, web graphs and collaborative networks. Clique percolation is one popular method used for unfolding the community structure in networks. However, clique percolation method is inefficient as the computational time is high for merging the identified cliques. This paper proposes a novel technique for detecting overlapping community s...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.