Global ETD Search

51	An efficient collision detection algorithm for polytopes in virtual environments 鍾達良, Chung, Tat-leung, Kelvin. January 1996 (has links) published_or_final_version / Computer Science / Master / Master of Philosophy Algorithms. Polytopes.
52	Geometric object reconstruction from orthogonal ray sum data 林吉雄, Lam, Kat-hung. January 1993 (has links) published_or_final_version / Computer Science / Master / Master of Philosophy Tomography. Algorithms.
53	Efficient stabbing algorithms for a set of objects 王富利, Wang, Fu-lee. January 1999 (has links) published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy Computer algorithms.
54	The power of greediness: a general methodology for designing approximation algorithms 劉興業, Lau, Hing-yip. January 1999 (has links) published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy Computer algorithms.
55	Maximum likelihood TDOA/DD estimation in a multipath propagation environment using the expectation-maximization algorithm Belanger, Scott Patrick 05 1900 (has links) No description available. Algorithms Detectors
56	Extending the metric multidimensional scaling with bregman divergences Sun, Jiang January 2010 (has links) No description available. 512.5 Algorithms
57	A K-seed genetic clustering algorithm with applications to cellular manufacturing Elisha, Karl Justin Edward January 1997 (has links) No description available. 658 Algorithms
58	Parallel simulations using recurrence relations and relaxation McGough, Andrew Stephen January 2000 (has links) This thesis develops and evaluates a number of efficient algorithms for performing parallel simulations. These algorithms achieve approximate linear speed-up, in the sense that their run times are in the order of O(n/p), when n is the size of the problem and p is the number of processors employed. The systems that are being simulated are related to ATM switches and sliding window communication protocols. The algorithms presented first are concern with the parallel generation and merging of bursty arrival sources, marking and deleting of lost cells due to buffer overflows and computation of departure instants. They work well on shared memory multiprocessors. However, different techniques need to be emulated in order to achieve similar speed-ups on a distributed cluster of workstations. The main obstacle is the inter-process communication overhead. To overcome it, new algorithms are developed that reduce considerably the amount of information transferred between processors. They are applied both to the ATM switch and to the sliding window protocol with feedbacks. In all cases, the methodology relies in reducing the simulation task to a set of recurrence relations. The latter are solved using the techniques of parallel prefix computation, parallel merging and relaxing. The effectiveness of these algorithms is evaluated by comparing their run times with that of an optimized sequential algorithm. A number of experiments are carried out on a 12-processor shared memory system, and also on a distributed cluster of 12 processors connected by a fast Ethernet. 005 Algorithms
59	Genetic algorithms and permutation-encoded problems : Ronald, S. P. Unknown Date (has links) Thesis (PhD)--University of South Australia, 1995 Genetic algorithms.
60	Adaptive CORDIC using parallel angle recording to accelerate CORDIC rotations / Rodrigues, Terence Keith, January 1900 (has links) Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references. Computer algorithms.

Search results