نتایج جستجو برای: algorithm architecture adequation

تعداد نتایج: 955316  

2012
Bryan Connor Silverthorn Bart Selman Peter Stone Adam Klivans Pradeep Ravikumar

vi

2010
Petr Pospichal Jirí Jaros Josef Schwarz

This paper deals with the mapping of the parallel islandbased genetic algorithm with unidirectional ring migrations to nVidia CUDA software model. The proposed mapping is tested using Rosenbrock’s, Griewank’s and Michalewicz’s benchmark functions. The obtained results indicate that our approach leads to speedups up to seven thousand times higher compared to one CPU thread while maintaining a re...

2008
Christophe Lucarz Marco Mattavelli Julien Dubois

The efficient implementation of multimedia algorithms, for the ever increasing complexity of the specifications and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires appropriate design space exploration procedures as preliminary step for any implementation. This paper describes a new platform aiming at supp...

2011
Kenneth Czechowski Casey Battaglino Chris McClanahan Aparna Chandramowlishwaran Richard W. Vuduc

Richard (Rich) Vuduc is an assistant professor in the School of Computational Science and Engineering at Georgia Tech. His research lab, the HPC Garage (hpcgarage.org), is interested in highperformance computing with focus areas in parallel algorithms, performance analysis, tuning, and debugging. He received an NSF CAREER award in 2010 and was an invited member of DARPA's 2009-2010 Computer Sci...

2012
V. S. K. Reddy S. Sengupta

This paper presents an efficient VLSI architecture design to achieve real time video processing using Full-Search Block Matching (FSBM) algorithm. The design employs parallel bank architecture with minimum latency, maximum throughput, and full hardware utilization. We use nine parallel processors in our architecture and each controlled by a state machine. State machine control implementation ma...

2013
Pierre-Yves Gicquel Dominique Lenne

This work aims to instrument situations of museum visit using mobile devices. The main objective is then to adapt activities and interactions seamlessly for the visitor, according to his desires, his physical location and psychological context. This adaptation involves a detailed model of the learning domain and of the visitor’s situation as well as the design of adaptation mechanisms to provid...

2005
Celina Maki Takemura Roberto Marcondes Cesar Junior Isabelle Bloch

The analysis of spatial relations among objects in an image is a important vision problem that involves both shape analysis and structural pattern recognition. In this paper, we propose a new approach to characterize the spatial relation along, an important feature of spatial configuration in space that has been overlooked in the literature up to now. We propose a mathematical definition of the...

2013
Ramanpreet Kaur Parminder Singh Jassal

The Coordinate Rotation DIgital Computer (CORDIC) algorithm has been used for many years for efficient implementation of vector rotation operations in hardware. It is executed merely by table look-up, shift, and addition operations. Thus, the corresponding hardware can be implemented in very economic fashion. Subsequently, it has been applied for many performances.CORDIC has been implemented in...

2005
RODNEY VAN METER KOHEI M. ITOH THADDEUS D. LADD

We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the “clock speed” of the quantum computer. The primary architectural features of interest are the ability to execute multiple gates concurrently, the number of application-level qubits available, and the i...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید