• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 228
  • 72
  • 30
  • 30
  • 17
  • 7
  • 6
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 516
  • 516
  • 106
  • 61
  • 59
  • 59
  • 58
  • 57
  • 55
  • 55
  • 54
  • 48
  • 48
  • 48
  • 48
  • 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.
1

Towards a framework for intuitive programming of cellular automata

Torbey, Sami 05 December 2007 (has links)
The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely tedious, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this thesis, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. We also demonstrate the power of that framework by using it to provide intuitive yet effective solutions to the two-dimensional majority classification problem, the convex hull of disconnected points problem, and various problems pertaining to node placement in wireless sensor networks. / Thesis (Master, Computing) -- Queen's University, 2007-12-05 10:26:09.591
2

Efficient Parallel Text Compression on GPUs

Zhang, Xiaoxi 2011 December 1900 (has links)
This paper demonstrates an efficient text compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 GHz CPU. We measure match finder time, range encoder compression time and demonstrate realtime performance on a large dataset: 10 GB web pages crawled by IRLbot. Our parallel range encoder is 15 times faster than sequential algorithm (FastAC) with static model.
3

Automatic parallelisation for a class of URE problems

Chen, Xian January 1995 (has links)
This thesis deals with the methodology and software of automatic parallelisation for numerical supercomputing and supercomputers. Basically, we focus on the problem of Uniform Recurrence Equations (URE) which exists widely in numerical computations. vVepropose a complete methodology of automatic generation of parallel programs for regular array designs. The methodology starts with an introduction of a set of canonical dependencies which generates a general modelling of the various URE problems. Based on these canonical dependencies, partitioning and mapping methods are developed which gives the foundation of the universal design process. Using the theoretical results we propose the structures of parallel programs and eventually generate automatically parallel codes which run correctly and efficiently on transputer array. The achievements presented in this thesis can be regarded as a significant progress in the area of automatic generation of parallel codes and regular (systolic) array design. This methodology is integrated and self-contained, and may be the only practical working package in this area.
4

De Haas - van Alphen oscillation in the vortex state

Miller, Paul January 1994 (has links)
No description available.
5

An integrated parallel/distributed environment for high performance computing

Valente, Fredy Joao January 1995 (has links)
No description available.
6

Fast sequential and parallel methods for solving multistage stochastic linear programmes

Thompson, R. T. January 1998 (has links)
No description available.
7

Heuristic knowledge representation and evidence combination parallelization

Hong, Xin January 2001 (has links)
No description available.
8

An investigation into architectures for a parallel packet reduction machine

Greenberg, Mark Irvine January 1989 (has links)
No description available.
9

Evolutionary algorithms for automatic parallelization

Williams, Kenneth Peter January 1998 (has links)
No description available.
10

Formal specification and verification of synchronous concurrent algorithms

Hobley, Keith Michael January 1990 (has links)
No description available.

Page generated in 0.0906 seconds