• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 14
  • 3
  • 2
  • 1
  • Tagged with
  • 937
  • 143
  • 105
  • 73
  • 73
  • 63
  • 44
  • 39
  • 35
  • 21
  • 16
  • 15
  • 15
  • 15
  • 15
  • 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.
301

Applications of Morphological Operators on Field Programmable Gate Arrays

Tickle, Andrew Jason January 2009 (has links)
No description available.
302

Tackling the computational complexity of understanding coalition formation in multi-agent systems

Dowell, Andrew James January 2010 (has links)
No description available.
303

Motion tracking in low resolution imagery

Govinda, Vivekanand January 2009 (has links)
No description available.
304

Persistence and modularity in PROLOG

Moffatt, D. S. January 1988 (has links)
Persistence is a feature of computer systems that makes data movement between primary and secondary memory transparent, allowing dynamically created objects to persist on disk, maintaining their referential structure, and able to be accessed in subsequent sessions. The research entailed the design and development of a persistent Prolog and of evaluating the final system. The development of a module system adequate for persistent applications soon became an integral part of the research. There are three main aspects to the thesis - a review of the issues of modularity and a description of the module scheme implemented for Persistent Prolog; the database view of Prolog and how persistent databases are integrated into it; and finally, external call-outs from Prolog and how to best use the persistent programming language PS-algol. Modules partition the program name space but also provide scope for updates to Prolog's internal database which makes them suitable models of the persistent partitions of the file store. In order to support exploratory updates to the Prolog database, modules can be committed independently allowing selected changes to be preserved. An atom based model of visibility was chosen for the modules because it simplified meta-level programming, allowed hiding of local data and supported independent modular commitment through separate module representations. The interface to PS-algol is a backtrackable one that allows tight coupling to externally supported databases and to algorithmic applications. The system's performance is an order of magnitudeslower than complete reads of dumped states but because of its incremental, shared and secure access to databases, it can be used for problems that defy the use of monolithic images.
305

A Software Development Process Model for Students of Object Technology

Capper, Graham January 2001 (has links)
No description available.
306

Reversible computations in B

Zeyda, Frank January 2007 (has links)
No description available.
307

Analysing intraday trading patterns and limit order book dynamics

Jiang, Jian January 2011 (has links)
No description available.
308

Specification refinement and program development in vZ

Kajtazi, Besnik January 2009 (has links)
No description available.
309

The evolution of recursive algorithms and object-oriented programs

Agapitos, Alexandros January 2009 (has links)
No description available.
310

Multi-Dimensional Binary Partition Tree for Content Retrieval

Ghanbari, Shirin January 2010 (has links)
No description available.

Page generated in 0.2129 seconds