• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2027
  • 398
  • 227
  • 61
  • 54
  • 41
  • 41
  • 41
  • 41
  • 41
  • 39
  • 22
  • 21
  • 18
  • 17
  • Tagged with
  • 5246
  • 3424
  • 3223
  • 2430
  • 1312
  • 790
  • 612
  • 584
  • 535
  • 495
  • 464
  • 426
  • 398
  • 382
  • 347
  • 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.
211

Multiprocessor computer architectures : algorithmic design and applications

Roomi, Akeel S. January 1989 (has links)
The contents of this thesis are concerned with the implementation of parallel algorithms for solving partial differential equations (POEs) by the Alternative Group EXplicit (AGE) method and an investigation into the numerical inversion of the Laplace transform on the Balance 8000 MIMO system. Parallel computer architectures are introduced with different types of existing parallel computers including the Data-Flow computer and VLSI technology which are described from both the hardware and implementation points of view. The main characteristics of the Sequent parallel computer system at Loughborough University is presented, and performance indicators, i.e., the speed-up and efficiency factors are defined for the measurement of parallelism in the system. Basic ideas of programming such computers are also outlined.....
212

The application of an electronic digital computer to problems in mathematics and physics

Gill, Stanley January 1953 (has links)
No description available.
213

Specification and control of execution of nondeterministic dataflow programs

Barahona, P. M. C. C. January 1987 (has links)
No description available.
214

Using intermediate results in parallel multi-source high-level vision algorithms

Austin, William John January 1997 (has links)
No description available.
215

Linguistic exchange for syntactic processing with co-operating users

Waugh, Kevin George January 1987 (has links)
No description available.
216

Spatio-temporal behaviour of optically bistable InSb etalons

Mullings, Jason Andrew January 1995 (has links)
No description available.
217

The use of information systems by dairy farmers in England and Wales

Guilhermino, Magda Maria January 1994 (has links)
No description available.
218

An investigation into the factors determining the use and adoption of computerized information systems in business management on a sample of Berkshire farms

Seixas, Mario Alves January 1989 (has links)
No description available.
219

A microcomputer-based education and communication system for children with cerebral palsy

Fowler, J. R. January 1988 (has links)
No description available.
220

Stochastic hybrid system : modelling and verification

Bujorianu, Manuela-Luminita January 2005 (has links)
Hybrid systems now form a classical computational paradigm unifying discrete and continuous system aspects. The modelling, analysis and verification of these systems are very difficult. One way to reduce the complexity of hybrid system models is to consider randomization. The need for stochastic models has actually multiple motivations. Usually, when building models complete information is not available and we have to consider stochastic versions. Moreover, non-determinism and uncertainty are inherent to complex systems. The stochastic approach can be thought of as a way of quantifying non-determinism (by assigning a probability to each possible execution branch) and managing uncertainty. This is built upon to the - now classical - approach in algorithmics that provides polynomial complexity algorithms via randomization. In this thesis we investigate the stochastic hybrid systems, focused on modelling and analysis. We propose a powerful unifying paradigm that combines analytical and formal methods. Its applications vary from air traffic control to communication networks and healthcare systems. The stochastic hybrid system paradigm has an explosive development. This is because of its very powerful expressivity and the great variety of possible applications. Each hybrid system model can be randomized in different ways, giving rise to many classes of stochastic hybrid systems. Moreover, randomization can change profoundly the mathematical properties of discrete and continuous aspects and also can influence their interaction. Beyond the profound foundational and semantics issues, there is the possibility to combine and cross-fertilize techniques from analytic mathematics (like optimization, control, adaptivity, stability, existence and uniqueness of trajectories, sensitivity analysis) and formal methods (like bisimulation, specification, reachability analysis, model checking). These constitute the major motivations of our research. We investigate new models of stochastic hybrid systems and their associated problems. The main difference from the existing approaches is that we do not follow one way (based only on continuous or discrete mathematics), but their cross-fertilization. For stochastic hybrid systems we introduce concepts that have been defined only for discrete transition systems. Then, techniques that have been used in discrete automata now come in a new analytical fashion. This is partly explained by the fact that popular verification methods (like theorem proving) can hardly work even on probabilistic extensions of discrete systems. When the continuous dimension is added, the idea to use continuous mathematics methods for verification purposes comes in a natural way. The concrete contribution of this thesis has four major milestones: 1. A new and a very general model for stochastic hybrid systems; 2. Stochastic reachability for stochastic hybrid systems is introduced together with an approximating method to compute reach set probabilities; 3. Bisimulation for stochastic hybrid systems is introduced and relationship with reachability analysis is investigated. 4. Considering the communication issue, we extend the modelling paradigm.

Page generated in 0.0597 seconds