Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Multitasking Computer science ). Showing records 121 – 150 of 173396 total matches.

[1] [2] [3] [4] [5] [6] [7] … [5780]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Texas A&M University

121. Soni, Sameer. Implementaion and performance of checkpointing schemes in a distributed environment.

Degree: MS, computer science, 2012, Texas A&M University

 The use of distributed systems has become increasingly popular due to increased computing power, reliability, availability, and efficiency in processing. Checkpointing and rollback recovery is… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Soni, S. (2012). Implementaion and performance of checkpointing schemes in a distributed environment. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6986

Chicago Manual of Style (16th Edition):

Soni, Sameer. “Implementaion and performance of checkpointing schemes in a distributed environment.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6986.

MLA Handbook (7th Edition):

Soni, Sameer. “Implementaion and performance of checkpointing schemes in a distributed environment.” 2012. Web. 07 Dec 2019.

Vancouver:

Soni S. Implementaion and performance of checkpointing schemes in a distributed environment. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6986.

Council of Science Editors:

Soni S. Implementaion and performance of checkpointing schemes in a distributed environment. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6986


Texas A&M University

122. Sonom, Donald George. Graph algorithms experimentation facility.

Degree: MS, computer science, 2012, Texas A&M University

 We provide a facility to experiment with graph algorithms. The facility is implemented as a client to XAGE, a software environment developed under the direction… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sonom, D. G. (2012). Graph algorithms experimentation facility. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6995

Chicago Manual of Style (16th Edition):

Sonom, Donald George. “Graph algorithms experimentation facility.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6995.

MLA Handbook (7th Edition):

Sonom, Donald George. “Graph algorithms experimentation facility.” 2012. Web. 07 Dec 2019.

Vancouver:

Sonom DG. Graph algorithms experimentation facility. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6995.

Council of Science Editors:

Sonom DG. Graph algorithms experimentation facility. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-S6995


Texas A&M University

123. Ellenberger, Ernest Lloyd. Transparent process rollback recovery: some new techniques and a portable implementation.

Degree: MS, computer science, 2012, Texas A&M University

 Processes in a distributed system can be made transparently recoverable through the use of process checkpointing, which periodically introduces a relatively large but temporary overhead,… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ellenberger, E. L. (2012). Transparent process rollback recovery: some new techniques and a portable implementation. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-E443

Chicago Manual of Style (16th Edition):

Ellenberger, Ernest Lloyd. “Transparent process rollback recovery: some new techniques and a portable implementation.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-E443.

MLA Handbook (7th Edition):

Ellenberger, Ernest Lloyd. “Transparent process rollback recovery: some new techniques and a portable implementation.” 2012. Web. 07 Dec 2019.

Vancouver:

Ellenberger EL. Transparent process rollback recovery: some new techniques and a portable implementation. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-E443.

Council of Science Editors:

Ellenberger EL. Transparent process rollback recovery: some new techniques and a portable implementation. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-E443


Texas A&M University

124. Gummadi, Vidya. Parallel discrete event simulation with predictors.

Degree: MS, computer science, 2012, Texas A&M University

 The motivation for this research has been its applicability in sequence checking in a spacecraft's control commands. Spacecrafts are controlled by sequences of time-tagged control… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gummadi, V. (2012). Parallel discrete event simulation with predictors. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-G86

Chicago Manual of Style (16th Edition):

Gummadi, Vidya. “Parallel discrete event simulation with predictors.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-G86.

MLA Handbook (7th Edition):

Gummadi, Vidya. “Parallel discrete event simulation with predictors.” 2012. Web. 07 Dec 2019.

Vancouver:

Gummadi V. Parallel discrete event simulation with predictors. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-G86.

Council of Science Editors:

Gummadi V. Parallel discrete event simulation with predictors. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-G86


Texas A&M University

125. Holland, Gavin D. Software implemented fault-tolernace on distributed-memory MIMD architectures.

Degree: MS, computer science, 2012, Texas A&M University

 Large multicomputer systems are inherently unreliable because of their enormous complexity. This has a direct impact on distributed computations performed on these systems. As the… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Holland, G. D. (2012). Software implemented fault-tolernace on distributed-memory MIMD architectures. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-H643

Chicago Manual of Style (16th Edition):

Holland, Gavin D. “Software implemented fault-tolernace on distributed-memory MIMD architectures.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-H643.

MLA Handbook (7th Edition):

Holland, Gavin D. “Software implemented fault-tolernace on distributed-memory MIMD architectures.” 2012. Web. 07 Dec 2019.

Vancouver:

Holland GD. Software implemented fault-tolernace on distributed-memory MIMD architectures. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-H643.

Council of Science Editors:

Holland GD. Software implemented fault-tolernace on distributed-memory MIMD architectures. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-H643


Texas A&M University

126. Kadiyala, Murali. A dynamic cache sub-lock design to reduce false sharing.

Degree: MS, computer science, 2012, Texas A&M University

 Parallel applications suffer from significant bus traffic due to the transfer of shared data. Large block sizes exploit locality and decrease the effective memory access… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kadiyala, M. (2012). A dynamic cache sub-lock design to reduce false sharing. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K33

Chicago Manual of Style (16th Edition):

Kadiyala, Murali. “A dynamic cache sub-lock design to reduce false sharing.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K33.

MLA Handbook (7th Edition):

Kadiyala, Murali. “A dynamic cache sub-lock design to reduce false sharing.” 2012. Web. 07 Dec 2019.

Vancouver:

Kadiyala M. A dynamic cache sub-lock design to reduce false sharing. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K33.

Council of Science Editors:

Kadiyala M. A dynamic cache sub-lock design to reduce false sharing. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K33


Texas A&M University

127. Kaul, Surbhi. Evaluation of Consistent Logical Checkpointing.

Degree: MS, computer science, 2012, Texas A&M University

 In the world of distributed processing it is desirable that the failure of one or more processes does not affect all the other processes. For… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kaul, S. (2012). Evaluation of Consistent Logical Checkpointing. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K38

Chicago Manual of Style (16th Edition):

Kaul, Surbhi. “Evaluation of Consistent Logical Checkpointing.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K38.

MLA Handbook (7th Edition):

Kaul, Surbhi. “Evaluation of Consistent Logical Checkpointing.” 2012. Web. 07 Dec 2019.

Vancouver:

Kaul S. Evaluation of Consistent Logical Checkpointing. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K38.

Council of Science Editors:

Kaul S. Evaluation of Consistent Logical Checkpointing. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K38


Texas A&M University

128. Kumar, Amit Virendra. Real-time communication in FDDI-based networks.

Degree: MS, computer science, 2012, Texas A&M University

 The Fiber Distributed Data Interface (FDDI) is recommended as a candidate for many hard real-time local-area communication systems. The Timed-Token Medium Access Control (MAC) Protocol… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kumar, A. V. (2012). Real-time communication in FDDI-based networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K86

Chicago Manual of Style (16th Edition):

Kumar, Amit Virendra. “Real-time communication in FDDI-based networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K86.

MLA Handbook (7th Edition):

Kumar, Amit Virendra. “Real-time communication in FDDI-based networks.” 2012. Web. 07 Dec 2019.

Vancouver:

Kumar AV. Real-time communication in FDDI-based networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K86.

Council of Science Editors:

Kumar AV. Real-time communication in FDDI-based networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-K86


Texas A&M University

129. Li, Hung. Scheduling of real-time communication network for parallel processing.

Degree: MS, computer science, 2012, Texas A&M University

 As real-time applications become more and more complicated their demands of processing capacity can hardly be satisfied. Massively parallel computers, such as Intel Paragon, with… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, H. (2012). Scheduling of real-time communication network for parallel processing. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-L552

Chicago Manual of Style (16th Edition):

Li, Hung. “Scheduling of real-time communication network for parallel processing.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-L552.

MLA Handbook (7th Edition):

Li, Hung. “Scheduling of real-time communication network for parallel processing.” 2012. Web. 07 Dec 2019.

Vancouver:

Li H. Scheduling of real-time communication network for parallel processing. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-L552.

Council of Science Editors:

Li H. Scheduling of real-time communication network for parallel processing. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-L552


Texas A&M University

130. Mulchandani, Kishore. Morphological modeling of neurons.

Degree: MS, computer science, 2012, Texas A&M University

 A formal representation of neuron morphology, adequate for the geometric modeling of manually-traced neurons, is presented. The concept of a stochastic L-system is then introduced… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mulchandani, K. (2012). Morphological modeling of neurons. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-M85

Chicago Manual of Style (16th Edition):

Mulchandani, Kishore. “Morphological modeling of neurons.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-M85.

MLA Handbook (7th Edition):

Mulchandani, Kishore. “Morphological modeling of neurons.” 2012. Web. 07 Dec 2019.

Vancouver:

Mulchandani K. Morphological modeling of neurons. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-M85.

Council of Science Editors:

Mulchandani K. Morphological modeling of neurons. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-M85


Texas A&M University

131. Perkins, Keith Douglas. Scheduling on the MasPar SIMD parallel computer.

Degree: MS, computer science, 2012, Texas A&M University

 This thesis studies the feasibility of a task scheduler for a parallel operating system. After analyzing several task scheduling algorithms, the highest level first algorithm… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Perkins, K. D. (2012). Scheduling on the MasPar SIMD parallel computer. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-P466

Chicago Manual of Style (16th Edition):

Perkins, Keith Douglas. “Scheduling on the MasPar SIMD parallel computer.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-P466.

MLA Handbook (7th Edition):

Perkins, Keith Douglas. “Scheduling on the MasPar SIMD parallel computer.” 2012. Web. 07 Dec 2019.

Vancouver:

Perkins KD. Scheduling on the MasPar SIMD parallel computer. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-P466.

Council of Science Editors:

Perkins KD. Scheduling on the MasPar SIMD parallel computer. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-P466


Texas A&M University

132. Rivera-Hernandez, Julio A. Providing ordered message delivery in communication network systems.

Degree: MS, computer science, 2012, Texas A&M University

 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… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rivera-Hernandez, J. A. (2012). Providing ordered message delivery in communication network systems. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-R58

Chicago Manual of Style (16th Edition):

Rivera-Hernandez, Julio A. “Providing ordered message delivery in communication network systems.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-R58.

MLA Handbook (7th Edition):

Rivera-Hernandez, Julio A. “Providing ordered message delivery in communication network systems.” 2012. Web. 07 Dec 2019.

Vancouver:

Rivera-Hernandez JA. Providing ordered message delivery in communication network systems. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-R58.

Council of Science Editors:

Rivera-Hernandez JA. Providing ordered message delivery in communication network systems. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-R58


Texas A&M University

133. Sustaita, Agapito. A static mapping of sparse Cholesky factorization onto distributed memory architectures.

Degree: MS, computer science, 2012, Texas A&M University

 The results of a new static mapping of the sparse Cholesky factorization problem onto two distributed memory architectures are presented within this report. This mapping… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sustaita, A. (2012). A static mapping of sparse Cholesky factorization onto distributed memory architectures. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877

Chicago Manual of Style (16th Edition):

Sustaita, Agapito. “A static mapping of sparse Cholesky factorization onto distributed memory architectures.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877.

MLA Handbook (7th Edition):

Sustaita, Agapito. “A static mapping of sparse Cholesky factorization onto distributed memory architectures.” 2012. Web. 07 Dec 2019.

Vancouver:

Sustaita A. A static mapping of sparse Cholesky factorization onto distributed memory architectures. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877.

Council of Science Editors:

Sustaita A. A static mapping of sparse Cholesky factorization onto distributed memory architectures. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877


Texas A&M University

134. Tewari, Sandeep. Implicit function modeling of neuron morphology.

Degree: MS, computer science, 2012, Texas A&M University

 Implicit functions are used to develop solid models of individual neurons as viewed at the limit of optical resolution. Stick models generated by the L-system… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tewari, S. (2012). Implicit function modeling of neuron morphology. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-T45

Chicago Manual of Style (16th Edition):

Tewari, Sandeep. “Implicit function modeling of neuron morphology.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-T45.

MLA Handbook (7th Edition):

Tewari, Sandeep. “Implicit function modeling of neuron morphology.” 2012. Web. 07 Dec 2019.

Vancouver:

Tewari S. Implicit function modeling of neuron morphology. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-T45.

Council of Science Editors:

Tewari S. Implicit function modeling of neuron morphology. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-T45


Texas A&M University

135. Balasubramaniam, Gaurishankar. Yield learning model for integrated circuit package.

Degree: MS, computer science, 2012, Texas A&M University

 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… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Balasubramaniam, G. (2012). Yield learning model for integrated circuit package. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B354

Chicago Manual of Style (16th Edition):

Balasubramaniam, Gaurishankar. “Yield learning model for integrated circuit package.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B354.

MLA Handbook (7th Edition):

Balasubramaniam, Gaurishankar. “Yield learning model for integrated circuit package.” 2012. Web. 07 Dec 2019.

Vancouver:

Balasubramaniam G. Yield learning model for integrated circuit package. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B354.

Council of Science Editors:

Balasubramaniam G. Yield learning model for integrated circuit package. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B354


Texas A&M University

136. Bell, Joshua Asher. Timing analysis of logic=level digital circuits using uncertainty intervals.

Degree: MS, computer science, 2012, Texas A&M University

 Timing Analysis of Logic-Level Digital Circuits Using Competitive design of modem digital circuits requires high performance at reduced cost and time-to-market. Timing analysis is increasingly… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bell, J. A. (2012). Timing analysis of logic=level digital circuits using uncertainty intervals. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B45

Chicago Manual of Style (16th Edition):

Bell, Joshua Asher. “Timing analysis of logic=level digital circuits using uncertainty intervals.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B45.

MLA Handbook (7th Edition):

Bell, Joshua Asher. “Timing analysis of logic=level digital circuits using uncertainty intervals.” 2012. Web. 07 Dec 2019.

Vancouver:

Bell JA. Timing analysis of logic=level digital circuits using uncertainty intervals. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B45.

Council of Science Editors:

Bell JA. Timing analysis of logic=level digital circuits using uncertainty intervals. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-B45


Texas A&M University

137. Cohen, Andrew L. An autoassociative model of recovery in memory.

Degree: MS, computer science, 2012, Texas A&M University

 A model of memory is presented. The model is a neural system which utilizes an autoassociator trained via the Buhmann learning rule. Context plays a… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cohen, A. L. (2012). An autoassociative model of recovery in memory. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-C64

Chicago Manual of Style (16th Edition):

Cohen, Andrew L. “An autoassociative model of recovery in memory.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-C64.

MLA Handbook (7th Edition):

Cohen, Andrew L. “An autoassociative model of recovery in memory.” 2012. Web. 07 Dec 2019.

Vancouver:

Cohen AL. An autoassociative model of recovery in memory. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-C64.

Council of Science Editors:

Cohen AL. An autoassociative model of recovery in memory. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-C64


Texas A&M University

138. Deng, Yuanhua. Some applications of pipelining techniques in parallel scientific computing.

Degree: MS, computer science, 2012, Texas A&M University

 In this thesis, we study the applicability of pipelining techniques to the development of parallel algorithms for scientific computation. General principles for pipelining techniques are… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Deng, Y. (2012). Some applications of pipelining techniques in parallel scientific computing. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-D48

Chicago Manual of Style (16th Edition):

Deng, Yuanhua. “Some applications of pipelining techniques in parallel scientific computing.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-D48.

MLA Handbook (7th Edition):

Deng, Yuanhua. “Some applications of pipelining techniques in parallel scientific computing.” 2012. Web. 07 Dec 2019.

Vancouver:

Deng Y. Some applications of pipelining techniques in parallel scientific computing. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-D48.

Council of Science Editors:

Deng Y. Some applications of pipelining techniques in parallel scientific computing. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-D48


Texas A&M University

139. Gandapur, Tasneem Kausar. Implementation and testing of a parallel layer peeling algorithm.

Degree: MS, computer science, 2012, Texas A&M University

 The objective of this thesis is to examine the feasibility of parallelizing a previously published sequential algorithm. This algorithm uses invariant imbedding to solve an… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gandapur, T. K. (2012). Implementation and testing of a parallel layer peeling algorithm. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G35

Chicago Manual of Style (16th Edition):

Gandapur, Tasneem Kausar. “Implementation and testing of a parallel layer peeling algorithm.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G35.

MLA Handbook (7th Edition):

Gandapur, Tasneem Kausar. “Implementation and testing of a parallel layer peeling algorithm.” 2012. Web. 07 Dec 2019.

Vancouver:

Gandapur TK. Implementation and testing of a parallel layer peeling algorithm. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G35.

Council of Science Editors:

Gandapur TK. Implementation and testing of a parallel layer peeling algorithm. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G35


Texas A&M University

140. Ghanem, Mohamed M. On the internet grouping for reliable multicasting.

Degree: MS, computer science, 2012, Texas A&M University

 Current implementation of multicasting is using UDP protocol which is unreliable. There are many problems in reliable multicasting that make it difficult to implement. A… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghanem, M. M. (2012). On the internet grouping for reliable multicasting. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G48

Chicago Manual of Style (16th Edition):

Ghanem, Mohamed M. “On the internet grouping for reliable multicasting.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G48.

MLA Handbook (7th Edition):

Ghanem, Mohamed M. “On the internet grouping for reliable multicasting.” 2012. Web. 07 Dec 2019.

Vancouver:

Ghanem MM. On the internet grouping for reliable multicasting. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G48.

Council of Science Editors:

Ghanem MM. On the internet grouping for reliable multicasting. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-G48


Texas A&M University

141. Iyer, Ravishankar. Distributed shared memory multiprocessors using multistage bus networks.

Degree: MS, computer science, 2012, Texas A&M University

 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… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Iyer, R. (2012). Distributed shared memory multiprocessors using multistage bus networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-I94

Chicago Manual of Style (16th Edition):

Iyer, Ravishankar. “Distributed shared memory multiprocessors using multistage bus networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-I94.

MLA Handbook (7th Edition):

Iyer, Ravishankar. “Distributed shared memory multiprocessors using multistage bus networks.” 2012. Web. 07 Dec 2019.

Vancouver:

Iyer R. Distributed shared memory multiprocessors using multistage bus networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-I94.

Council of Science Editors:

Iyer R. Distributed shared memory multiprocessors using multistage bus networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1996-THESIS-I94


Texas A&M University

142. Koothrappally, Joseph. CARSystem: a distributed algorithm for efficient real-time vehicular traffic control.

Degree: MS, computer science, 2012, Texas A&M University

 Traffic operations using centralized adaptive systems require heavy infrastructure and processing power. Distributed strategies can provide scaleable and more fault-tolerant systems. Distributed traffic control systems,… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Koothrappally, J. (2012). CARSystem: a distributed algorithm for efficient real-time vehicular traffic control. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K665

Chicago Manual of Style (16th Edition):

Koothrappally, Joseph. “CARSystem: a distributed algorithm for efficient real-time vehicular traffic control.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K665.

MLA Handbook (7th Edition):

Koothrappally, Joseph. “CARSystem: a distributed algorithm for efficient real-time vehicular traffic control.” 2012. Web. 07 Dec 2019.

Vancouver:

Koothrappally J. CARSystem: a distributed algorithm for efficient real-time vehicular traffic control. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K665.

Council of Science Editors:

Koothrappally J. CARSystem: a distributed algorithm for efficient real-time vehicular traffic control. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K665


Texas A&M University

143. Krishnamoorthy, Deviusha. Performance evaluation of configurable arrays with mesh interconnections and wormhole routing.

Degree: MS, computer science, 2012, Texas A&M University

 Large scale multiprocessors are built on a particular interconnection network with a fixed number of processors. The interconnections are based on topologies like mesh, hypercube,… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krishnamoorthy, D. (2012). Performance evaluation of configurable arrays with mesh interconnections and wormhole routing. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K74

Chicago Manual of Style (16th Edition):

Krishnamoorthy, Deviusha. “Performance evaluation of configurable arrays with mesh interconnections and wormhole routing.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K74.

MLA Handbook (7th Edition):

Krishnamoorthy, Deviusha. “Performance evaluation of configurable arrays with mesh interconnections and wormhole routing.” 2012. Web. 07 Dec 2019.

Vancouver:

Krishnamoorthy D. Performance evaluation of configurable arrays with mesh interconnections and wormhole routing. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K74.

Council of Science Editors:

Krishnamoorthy D. Performance evaluation of configurable arrays with mesh interconnections and wormhole routing. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K74


Texas A&M University

144. Krishna Moorthy, Jayasankar. Design of a Host Traffic Management system for Hard Real Time networks.

Degree: MS, computer science, 2012, Texas A&M University

 A Hard Real Time (HRT) system is one whose correct functioning is based on the concepts of timely and correct delivery. By timely delivery, we… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krishna Moorthy, J. (2012). Design of a Host Traffic Management system for Hard Real Time networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K75

Chicago Manual of Style (16th Edition):

Krishna Moorthy, Jayasankar. “Design of a Host Traffic Management system for Hard Real Time networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K75.

MLA Handbook (7th Edition):

Krishna Moorthy, Jayasankar. “Design of a Host Traffic Management system for Hard Real Time networks.” 2012. Web. 07 Dec 2019.

Vancouver:

Krishna Moorthy J. Design of a Host Traffic Management system for Hard Real Time networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K75.

Council of Science Editors:

Krishna Moorthy J. Design of a Host Traffic Management system for Hard Real Time networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-K75


Texas A&M University

145. Liang, Chai. Experiment on ATM traffic analysis.

Degree: MS, computer science, 2012, Texas A&M University

 ATM is one of the most promising multiplexing and switching technologies for the future B-ISDN infrastructure. One of the important features of ATM is its… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liang, C. (2012). Experiment on ATM traffic analysis. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-L443

Chicago Manual of Style (16th Edition):

Liang, Chai. “Experiment on ATM traffic analysis.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-L443.

MLA Handbook (7th Edition):

Liang, Chai. “Experiment on ATM traffic analysis.” 2012. Web. 07 Dec 2019.

Vancouver:

Liang C. Experiment on ATM traffic analysis. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-L443.

Council of Science Editors:

Liang C. Experiment on ATM traffic analysis. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-L443


Texas A&M University

146. Morsy, Hazem Kamal. A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm.

Degree: MS, computer science, 2012, Texas A&M University

 Distributed systems have become a popular computing environment. Due to their high potentials in improving performance and resource sharing, the evolution and maturing of technologies… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Morsy, H. K. (2012). A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-M69

Chicago Manual of Style (16th Edition):

Morsy, Hazem Kamal. “A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-M69.

MLA Handbook (7th Edition):

Morsy, Hazem Kamal. “A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm.” 2012. Web. 07 Dec 2019.

Vancouver:

Morsy HK. A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-M69.

Council of Science Editors:

Morsy HK. A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-M69


Texas A&M University

147. Perisetty, Srinivas. Design of proximity detecting codes.

Degree: MS, computer science, 2012, Texas A&M University

 Information can be transmitted over a channel synchronously or asynchronously. When the communication channel is asynchronous, then the receiver is not sure when the data… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Perisetty, S. (2012). Design of proximity detecting codes. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-P475

Chicago Manual of Style (16th Edition):

Perisetty, Srinivas. “Design of proximity detecting codes.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-P475.

MLA Handbook (7th Edition):

Perisetty, Srinivas. “Design of proximity detecting codes.” 2012. Web. 07 Dec 2019.

Vancouver:

Perisetty S. Design of proximity detecting codes. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-P475.

Council of Science Editors:

Perisetty S. Design of proximity detecting codes. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-P475


Texas A&M University

148. Sundaresan, Sharad. Distributed connection management for real-time communication over wormhole-routed networks.

Degree: MS, computer science, 2012, Texas A&M University

 Wormhole networks provide a very high-speed communication medium that is well suited for a large number of bandwidth demanding applications. Unfortunately, the lack of buffering… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sundaresan, S. (2012). Distributed connection management for real-time communication over wormhole-routed networks. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S885

Chicago Manual of Style (16th Edition):

Sundaresan, Sharad. “Distributed connection management for real-time communication over wormhole-routed networks.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S885.

MLA Handbook (7th Edition):

Sundaresan, Sharad. “Distributed connection management for real-time communication over wormhole-routed networks.” 2012. Web. 07 Dec 2019.

Vancouver:

Sundaresan S. Distributed connection management for real-time communication over wormhole-routed networks. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S885.

Council of Science Editors:

Sundaresan S. Distributed connection management for real-time communication over wormhole-routed networks. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S885


Texas A&M University

149. Swarna, Madhukiran V. Combinational logic optimization for low power using implication-based transformations.

Degree: MS, computer science, 2012, Texas A&M University

 The demand for portable equipment has increased the emphasis on low-power designs. Higher power consumption results in shorter battery-lifetime of portable electronic devices. As a… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Swarna, M. V. (2012). Combinational logic optimization for low power using implication-based transformations. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S93

Chicago Manual of Style (16th Edition):

Swarna, Madhukiran V. “Combinational logic optimization for low power using implication-based transformations.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S93.

MLA Handbook (7th Edition):

Swarna, Madhukiran V. “Combinational logic optimization for low power using implication-based transformations.” 2012. Web. 07 Dec 2019.

Vancouver:

Swarna MV. Combinational logic optimization for low power using implication-based transformations. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S93.

Council of Science Editors:

Swarna MV. Combinational logic optimization for low power using implication-based transformations. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-S93


Texas A&M University

150. Walter, Jennifer E. Hazard-free connection release.

Degree: MS, computer science, 2012, Texas A&M University

 Fault-tolerant communication in a distributed system requires reliable connection management and message delivery. Reliable connection management includes the guarantee of hazard-free release, in which no… (more)

Subjects/Keywords: computer science.; Major computer science.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walter, J. E. (2012). Hazard-free connection release. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-W156

Chicago Manual of Style (16th Edition):

Walter, Jennifer E. “Hazard-free connection release.” 2012. Masters Thesis, Texas A&M University. Accessed December 07, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-W156.

MLA Handbook (7th Edition):

Walter, Jennifer E. “Hazard-free connection release.” 2012. Web. 07 Dec 2019.

Vancouver:

Walter JE. Hazard-free connection release. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Dec 07]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-W156.

Council of Science Editors:

Walter JE. Hazard-free connection release. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1997-THESIS-W156

[1] [2] [3] [4] [5] [6] [7] … [5780]

.