Browsing by Subject "Algorithms"
Now showing items 1-20 of 23
-
(Texas A&M University. Libraries, 1982)Quantization plays an important role in most communication schemes, yet, though extensive results are available for scalar quantization, till recent years very little appeared in the literature concerning the design of ...
-
(2019-11-08)The original Moore’s law has slowed down. It has become unfeasible to double the number of transistor per unit area on integrated circuits every 18 to 24 months. However, the continuous need for computation power is driving ...
-
(Texas A&M University. Libraries, 1983)We consider a bin-packing problem where the sizes of the bins are allowed to vary and where the goal is to maximize the number of pieces packed. This problem is NP-Hard. We examine a new efficient approximation algorithm ...
-
(Texas A&M University. Libraries, 09 AUG 196)
-
(American Geophysical Union, 2013)
-
(2015-08-05)This dissertation aims at developing generalized network models and solution approaches for studying cluster detection problems that typically arise in networks. More specifically, we consider graph theoretic relaxations ...
-
(Texas A&M University. Libraries, 1981)Frequently algorithm users can select their solution strategy by choosing from among various options for each of several algorithm factors. If the algorithm will always eventually find a solution, the important question ...
-
(2019-05-17)Distributed systems ranging from small local area networks to large wide area networks like the Internet composed of static and/or mobile users have become increasingly popular. A desirable property for any distributed ...
-
(Texas A&M University. Libraries, 1982)The proposed gain adaptive deadtime compensation (GADC) algorithm and observer forms of compensation are developed for controlling a process with deadtime and varying characteristics. The GADC algorithm utilizes a gain ...
-
(2009-05-15)Multiple sequence alignment is an important bioinformatics problem, with applications in diverse types of biological analysis, such as structure prediction, phylogenetic analysis and critical sites identification. In recent ...
-
(Texas A&M University. Libraries, 1983)In this work, a continuous differential equation model describing the evolution of the mean number in an M/M/1 queue has been developed. The validity of this approximation has been established by comparisons with work by ...
-
(Texas A&M University. Libraries, 1992)A task allocation algorithm in a parallel system assigns tasks to each processor with a goal of minimizing both execution and communication costs. Previous research shows the need for algorithms which can approximate this ...
-
(2010-11-11)Recent advancements in sensory devices are presenting various opportunities for widespread applications of wireless sensor networks (WSNs). The most distinguishing characteristic of a WSN is the fact that its sensors have ...
-
(2012-10-19)The objective of this dissertation is to study commonly occurring location and clustering problems on graphs. The dissertation is presented as a collection of results in topics including finding maximum cliques in large ...
-
(Texas A&M University. Libraries, 1990)Proximity problems deal with "closeness" of points in a finite set in k-dimensional space under some distance metric L (subscript p). These problems arise in many applications such as pattern recognition, wire routing, and ...
-
(Texas A&M University. Libraries, 1989)Unification, which has applications in databases, expert and knowledge-based systems, and natural language and image processing, is known to be the most repeated operation in logic and PROLOG interpreters. Slow execution ...
-
(Texas A&M University. Libraries, 1987)Currently industry and academia are interested in finding ways to employ artificial intelligence technology in useful applications. Expert systems, a major subdivision of artificial intelligence, have been used successfully ...
-
(Texas A&M University, 2006-10-30)Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ...
-
(2015-07-28)The inference of species divergence time is a key step in the study of phylogenetics. Methods have been available for the last ten years to perform the inference, but, there are two significant problems with these methods. ...
-
(2023-01-19)Autonomous vehicles(AVs) have the potential to revolutionize how we ultimately perceive modern transportation. Many current car models already feature advanced driver-assist systems (ADAS), such as adaptive cruise control ...