The recent booming interest in Knowledge Grid is just there. It can at least be revealed by the tens of thousands of related entries that Google.com returns based on these two buzzwords. If the ultimate goal of Grid computing is to facilitate distributed computing power access in a seemless manner, that of Knowledge Grid is to mobilize the distributed knowledge for effective reuse. “The Knowled...

Load balancing is one of the major search areas in grid computing. The strategy of the grid computing is another important topic. Job scheduling is the way of scheduling jobs in a grid environment that contains heterogeneous resources. The strategy of the grid computing describes the overall model of the grid hierarchy. Some papers show a tree model for a grid computing. This paper enhances a m...

A new trust-based model is developed for optimizing resource allocation in a distributed Grid computing environment. Highly shared resources in a Grid create the insecurity and dependability concerns that hinder distributed applications. We model the Grid resource allocation process as a multi-objective integer-programming problem. Trusted Grid computing power is maximized over multiple resourc...

GBP/USD currency exchange rates. A grid search is used to choose the optimal parameters.

A wideband off-grid model is proposed to represent dictionary mismatch under the compressive sensing framework exploiting difference co-arrays. A group sparsity based off-grid method is proposed for underdetermined wideband direction of arrival (DOA) estimation which provides improved performance over the existing group sparsity based method with a same search grid. A two-step approach is then ...

In this paper we describe and evaluate a fast implementation of a classical block matching motion estimation algorithm for multiple Graphical Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) computing engine. The implemented block matching algorithm (BMA) uses summed absolute difference (SAD) error criterion and full grid search (FS) for finding optimal block displac...

Local interest points (LIPs) and their features have been shown to obtain surprisingly good results in object detection and recognition. Its effectiveness and scalability, however, have not been seriously addressed in large-scale multimedia database, for instance TRECVID benchmark. The goal of our works is to investigate the role and performance of LIPs, when coupling with multi-modality featur...

Our research aims to further our understanding of grid enabled knowledge management services. We do so by developing the novel notion of knowledge management services that are derived from a synthesis of current taxonomies in knowledge management and grounded by categories obtained through an elicitation exercise involving domain experts. The latter activity is part of GRACE Grid enabled Search...

Nowadays, the Grid is the focus of multiple researches. Our work is centered on Resource Management for Grids as it is an opened and current research area. Decentralized, scalable and efficient resource search algorithms are one of the key issues for resource management in large Grid systems. Resource search is required in order to allocate applications and data efficiently and to maintain the ...

This paper investigates the capabilities of tabu search for solving the global path planning problem in grid maps. Accordingly, a tabu search system model is designed and a tabu search planner algorithm for solving the path planning problem is proposed. A comprehensive simulation study is conducted using the proposed model and algorithm, in terms of solution quality and execution time. A compar...