Search
Now showing items 71-80 of 169
A new acceleration technique for the backpropagation neural network paradigm
(Texas A&M University, 1991)
Not available
Visualization and continuous simulation of a space nuclear power system
(Texas A&M University, 1992)
Not available
Some observations on Goldberg-Trajan's Maximum Flow algorithm on Bipartite Graphs
(Texas A&M University, 1997)
Maximum Matching Problem on Bipartite Graph (MMPBG) has attracted attentions because of its intuitive nature and its wide applicability. The best time efficiency for it is O(Vn- m) up to date, which is obtained through ...
Providing ordered message delivery in communication network systems
(Texas A&M University, 1995)
Many previous papers about network protocols have focused their attention on totally non-FIFO networks where packets may be delivered arbitrarily out of order relative to their sending order. More realistic networks have ...
Yield learning model for integrated circuit package
(Texas A&M University, 1996)
In a semiconductor industry, packaging of integrated circuit chips, product quality control and rapid problem diagnosis are very critical to economic success. The integrated circuit package makes up a large fraction of the ...
Mapping onto mesh connected multiprocessors
(Texas A&M University, 1993)
typically consist of several computationally intensive modules that are designed to execute in parallel while communicating amongst themselves. When such a program is to be executed on a parallel computer, it would be ...
Distributed shared memory multiprocessors using multistage bus networks
(Texas A&M University, 1996)
Distributed shared memory (DSM) multiprocessors rely heavily on the interconnection network performance. The Multistage Bus Network (MBN) is analyzed in this thesis for a DSM environment. The MBN avoids some of the ...
Geographic multicasting in wireless ad-hoc networks
(Texas A&M University, 1998)
This thesis proposes a new protocol for providing a location based massaging framework in wireless ad-hoc networks. In such a scheme, the destination for a message would be the set of all hosts which lie in a particular ...
A hybrid of the genetic algorithm and concurrent simplex
(Texas A&M University, 1995)
Not available
A distributed computing environment for volume visualization
(Texas A&M University, 1992)
Not available