Browsing Division of Electrical, Electronics, and Computer Science (EECS) by thesis submitted date"1990"
Now showing items 1-8 of 8
-
DPLL's for network synchronization: a new approach.
A new DPLL has been described in this thesis to overcome some of the limitations of the conventional second-order DPLL in the context of network synchronization applications. The analytical and computer simulation studies ... -
An Implementation of Cross Architecture Procedure Call
(Indian Institute of Science, 2005-01-26)workstations are ideally suited for computing jobs which require an interactive environment because they are basically single user machines and hence provide consistent response time. Another factor is the availability ... -
Integrated analytical models for parallel and distributed computing systems
Analytical modelling plays an important role in the design and development of parallel and distributed computing systems. In this context, Product Form Queueing Networks (PFQNs) and Generalized Stochastic Petri Nets (GSPNs) ... -
Knowledge-based preanalysis for multilevel clustering
Multilevel clustering offers the cluster analyst flexibility of choosing different algorithms at different levels with the possibility of reducing overall computational effort in comparison with the single-level application ... -
Neural networks for invariant recognition of 2-D objects
This thesis studies the problem of translation-, rotation- and size-invariant recognition of two-dimensional objects. This problem can be framed as follows: Given (i) a set of object descriptions in terms of either global ... -
PEG: a programming environment generator
Integrated piogramming enviionments play an im portant role in making the software development process easier and more efficient. Since there exist a number of programming languages, it is necessary to provide programmers ... -
Programmable nonlinear ADCS -some new techniques
New Program mable Successive Approximation NADCs In this class of NADCs, the main emphasis has been to achieve digital programmability by using optimal-sized ROM, or PLS in the successive approximation loop while at the ... -
Weak visibility and related problems on simple polygons
Visibility and shortest path problems are two important areas of research in computational geometry. In this thesis we study weak visibility and related problems on simple polygons and propose efficient algorithms. We study ...