• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 754
  • 350
  • 73
  • 73
  • 73
  • 73
  • 73
  • 72
  • 48
  • 31
  • 9
  • 5
  • 5
  • 4
  • 3
  • Tagged with
  • 1704
  • 1704
  • 271
  • 254
  • 245
  • 209
  • 186
  • 186
  • 175
  • 168
  • 145
  • 138
  • 137
  • 128
  • 125
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
61

Design and implementation of an Intelligent Cost Estimation Model for Decision Support System software

Blazer, William E. January 1990 (has links) (PDF)
Thesis (M.S. in Information Systems)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Bui, Tung X. Second Reader: Abdel-Hamid, Tarek. "September 1990." Description based on title screen viewed on December 16, 2009. DTIC Descriptor(s): Computer programs, methodology, parametric analysis, environments, sizes(dimensions), decision support systems, cost estimates, theses, estimates, costs, cost models, mathematical models, models DTIC Identifier(s): Cost estimates, models, computer programs, decision support systems, Author(s) subject terms: Software cost estimation model; COCOMO, function point Includes bibliographical references (p. 115-118). Also available in print.
62

Lower confidence interval bounds for coherent systems with cyclic components

Covington, Valerie A. January 1990 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Woods, W. Max. Second Reader: Whitaker, Lyn R. "September 1990." Description based on title screen viewed on December 17, 2009. DTIC Descriptor(s): Computer programs, intervals, confidence limits, accuracy, theses, Monte Carlo method, cycles, fortran, reliability, yield, standardization, statistical distributions, equations, confidence level, poisson density functions, failure, coherence, binomials, computerized simulation. Author(s) subject terms: Reliability, lower confidence limit, coherent systems, cyclic components. Includes bibliographical references (p. 121-122). Also available in print.
63

Symbolic model checking techniques for BDD-based planning in distributed environments

Goel, Anuj, January 2002 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.
64

Symbolic model checking techniques for BDD-based planning in distributed environments /

Goel, Anuj, January 2002 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references (leaves 175-180). Available also in a digital version from Dissertation Abstracts.
65

A system for data flow analysis /

Chan, Fun-ting. January 1982 (has links)
Thesis--M. Phil., University of Hong Kong, 1983.
66

Probabilistic model-based clustering of complex data

Zhong, Shi 28 August 2008 (has links)
Not available / text
67

Model checking: beyond the finite

Kahlon, Vineet 28 August 2008 (has links)
Not available / text
68

Structured software usability evaluation: an experiment in evaluation design

Faulkner, Laura Lynn 29 August 2008 (has links)
Not available / text
69

The implementation of an optimizing compiler for Icon.

Walker, Kenneth William. January 1991 (has links)
There are many optimizations that can be applied while translating Icon programs. These optimizations and the analyses needed to apply them are of interest for two reasons. First, Icon's unique combination of characteristics requires developing new techniques for implementing them. Second, these optimizations are used in variety of languages and Icon can be used as a medium for extending the state of the art. Many of these optimizations require detailed control of the generated code. Previous production implementations of the Icon programming language have been interpreters. The virtual machine code of an interpreter is seldom flexible enough to accommodate these optimizations and modifying the virtual machine to add the flexibility destroys the simplicity that justified using an interpreter in the first place. These optimizations can only reasonably be implemented in a compiler. In order to explore these optimizations for Icon programs, a compiler was developed. This dissertation describes the compiler and the optimizations it employs. It also describes a run-time system designed to support the analyses and optimizations. Icon variables are untyped. The compiler contains a type inferencing system that determines what values variables and expression may take on during program execution. This system is effective in the presence of values with pointer semantics and of assignments to components of data structures. The compiler stores intermediate results in temporary variables rather than on a stack. A simple and efficient algorithm was developed for determining the lifetimes of intermediate results in the presence of goal-directed evaluation. This allows an efficient allocation of temporary variables to intermediate results. The compiler uses information from type inferencing and liveness analysis to simplify generated code. Performance measurements on a variety of Icon programs show these optimizations to be effective.
70

Interval logic and modified labelled-net for system specificationand verification

趙炳權, Chiu, Ping-kuen, Peter. January 1985 (has links)
published_or_final_version / Electrical Engineering / Master / Master of Philosophy

Page generated in 0.0573 seconds