 IDEALS Home
 →
 Browse by Subject
Browse by Subject "Computer Science"
Now showing items 120 of 801

(1987)Traditional theories measure the complexity of a function as a lower bound on the cost of its implementation. Since the results of the theory are biased by the chosen implementation paradigm and its associated cost measure, ...
application/pdf
PDF (4Mb) 
(1987)This thesis describes a module planner for decomposing arbitrary functional specifications of any complexity into abstract cells for customVLSI module generation. A graph representing random logic is partitioned and the ...
application/pdf
PDF (4Mb) 
(1984)In evaluating a query using a network database, the links need to either be followed or be saved. Most of the previous approaches follow the links in evaluating a query using a network database. Actually, it is not always ...
application/pdf
PDF (4Mb) 
(1988)Tracedriven simulation is a simple way of evaluating cache memory systems with varying hardware parameters. But to evaluate realistic workloads, simulating even a few million addresses is not adequate and such large scale ...
application/pdf
PDF (3Mb) 
(200812)Wireless sensor networks (WSNs) were originally motivated by military applications, and are becoming integral part of more and more civilian applications to improve quality of life. With current wireless sensor network ...
application/pdf
PDF (4Mb) 
(1995)Memory latency has always been a major issue in sharedmemory multiprocessors and highspeed systems. This is even more true as the gap between processor and memory speeds continues to grow. Data prefetching has been ...
application/pdf
PDF (6Mb) 
(1996)Effective file system caching reduces local disk accesses and remote file server accesses significantly. Traditional file systems use fixed strategies to control caching. This thesis shows that a file system with adaptive ...
application/pdf
PDF (10Mb) 
(1990)We investigate various methods for making efficient use of the timevarying power received by radio reflection from meteor trails, including applications of variablerate coding and variablerate transmission. For variablerate ...
application/pdf
PDF (5Mb) 
(1980)Two new algebraic branch and bound methods for the design of Programmable Logic Arrays are presented in this thesis. These produce a minimal sum for a wide range of functions for which conventional methods fail. Programs ...
application/pdf
PDF (7Mb) 
application/pdf
PDF (13Mb) 
(200808)In the denition of domainspecic languages a MOF metamodel is used to dene the main types of its abstract syntax, and OCL invariants are used to add semantic constraints. The semantics of a metamodel denition can be given ...
application/pdf
PDF (372Kb) 
(1983)This thesis describes an algorithm which automatically integrates systems of ordinary differential equations which have highly oscillatory solutions. Natural variable step derivations of the Generalized Adams and Generalized ...
application/pdf
PDF (4Mb) 
application/pdf
PDF (5Mb) 
(1987)The thesis addresses the algorithmic design aspect of VLSI circuit layout. We study several optimization problems that arise from various stages of circuit layout. In particular, we consider problems chosen from the area ...
application/pdf
PDF (5Mb) 
(1994)Various physical design problems in Very Large Scale Integrated (VLSI) circuits and FieldProgrammable Gate Arrays (FPGA) are studied in this thesis. Specifically, we study (1) the area minimization problem in floorplans ...
application/pdf
PDF (7Mb) 
(1994)The goal of this research is to develop a systematic, integrated method of designing efficient search algorithms that solve optimization problems in real time. Search algorithms studied in this thesis comprise metacontrol ...
application/pdf
PDF (14Mb) 
application/pdf
PDF (3Mb) 
(1985)As the complexity of logic circuits which may be placed on an integrated circuit grows, the complexity and length of the design process increases also. Consequently, there have been increased efforts in recent years directed ...
application/pdf
PDF (8Mb) 
(1988)This thesis considers several problems arising during VLSI layout and presents new techniques for solving them efficiently.
application/pdf
PDF (4Mb) 
(1990)This thesis considers the problems arising from VLSI routing design. Algorithms are proposed for solving both global and local routing problems.
application/pdf
PDF (5Mb)
Now showing items 120 of 801