Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
110
A REVIEW ON COMPARISION OF BINARY SEARCH AND LINEAR SEARCH
"... After the years of research done by scientists, it is found that binary search is more efficient than the linear search.Earlier, the sorting time of linear search before the application of binary search appeared not to have been considered. In Linear search algorithm searching begins with searching ..."
Abstract
- Add to MetaCart
After the years of research done by scientists, it is found that binary search is more efficient than the linear search.Earlier, the sorting time of linear search before the application of binary search appeared not to have been considered. In Linear search algorithm searching begins with searching
Binary Affinity Genetic Algorithm ∗
"... Based on certain phenomena from the human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals are guaranteed to survive for certain number of generatio ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Based on certain phenomena from the human society and nature, we propose a binary affinity genetic algorithm (aGA) by adopting the following strategies: the population is adaptively updated to avoid stagnation; the newly generated individuals are guaranteed to survive for certain number
Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List
"... Information retrieval is the most fundamental requirement for any kind of computing application and which requires search operation to be performed from massive databases implemented by various data structures. Searching an element from the list is the fundamental aspects in computing world. Numbers ..."
Abstract
- Add to MetaCart
search on linked linear list. This paper also analyzes both the algorithms at some extent for the applicability and execution efficiency. This paper also analyzes the few data structures to implement these algorithms. At last based on the linear search and binary search algorithms, one algorithm
Binary Search Tree Balancing Methods: A Critical Study
"... Binary search tree is a best-suited data structure for data storage and retrieval when entire tree could be accommodated in the primary memory. However, this is true only when the tree is height-balanced. Lesser the height faster the search will be. Despite of the wide popularity of Binary search tr ..."
Abstract
- Add to MetaCart
trees there has been a major concern to maintain the tree in proper shape. In worst case, a binary search tree may reduce to a linear link list, thereby reducing search to be sequential. Unfortunately, structure of the tree depends on nature of input. If input keys are not in random order the tree
Longest-match String Searching for Ziv-Lempel Compression
, 1993
"... This paper presents eight data structures that can be used to accelerate the searching, including adaptations of four methods normally used for exact matching searching. The algorithms are evaluated analytically and empirically, indicating the trade-offs available between compression speed and memor ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
This paper presents eight data structures that can be used to accelerate the searching, including adaptations of four methods normally used for exact matching searching. The algorithms are evaluated analytically and empirically, indicating the trade-offs available between compression speed
On solving the Partial MAX-SAT problem
- In International Conference on Theory and Applications of Satisfiability Testing (SAT’06), LNCS 4121
, 2006
"... Abstract. Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general SAT problem. In this paper, we consider one importan ..."
Abstract
-
Cited by 79 (1 self)
- Add to MetaCart
instance by adding relaxation variables. The second approach is encoding based; it constructs an efficient auxiliary counter that constrains the number of relaxed clauses and supports binary search or linear scan for the optimal solution. Both solvers are complete as they guarantee the optimality
und Computeralgebra (CDC) Algebraic methods in analyzing lightweight cryptographic symmetric primitives
"... Algebraic methods in analyzing ..."
TECHNOLOGY ANALYSIS AND COMPARATIVE STUDY OF SEARCHING TECHNIQUES
"... We live in the age of technolgy and it is quiet obvious that it is increasing day-by-day endlessly. In this technical era researchers are focusing on the development of the existing technologies. Software engineering is the dominant branch of Computer Science that deals with the development and anal ..."
Abstract
- Add to MetaCart
and analysis of the software. The objective of this study is to analyze and compare the existing searching algorithms (linear search and binary search). In this paper, we will discuss both these searching algorithms and compare them on the basis of their time complexities for given set of data.
A Renee Equation for Algorithmic Complexity
- Lecture Notes in Computer Science
, 2001
"... We introduce a notion of complexity for the renee equation and use it to develop a method for analyzing search algorithms which enables a uniform treatment of techniques that manipulate discrete data, like linear and binary search of lists, as well as those which manipulate continuous data, like me ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We introduce a notion of complexity for the renee equation and use it to develop a method for analyzing search algorithms which enables a uniform treatment of techniques that manipulate discrete data, like linear and binary search of lists, as well as those which manipulate continuous data, like
likelihood and the role of models in molecular phylogenetics.
- Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract
-
Cited by 70 (11 self)
- Add to MetaCart
] algorithm provides a linear time algorithm for computing the parsimony score). In this paper we will explore most of these objections and survey some recent theoretical results that shed light on the interplay between the two methodologies and on the limits of what one can hope to achieve in phylogeny
Results 1 - 10
of
110
