Results 251 to 260 of about 984,534 (293)
Some of the next articles are maybe not open access.
Grid-based distributed search structure
Proceedings of the 44th annual Southeast regional conference, 2006This paper describes research in progress to design and implement an efficient distributed indexing and search structure. This will be a modified, distributed B+ tree that will be used to index and locate disparate data within a grid environment. A common interface will be provided to seamlessly locate varied data sources and formats that will be ...
openaire +1 more source
Parallel search for Ramsey grid colorings
Proceedings of the 50th Annual Southeast Regional Conference, 2012Monochromatic-square-free grid coloring is a challenging computational problem with connections to Ramsey-theoretic combinatorics and multiparty communication complexity for which no polynomial time algorithm is known. In this paper, we report on a parallel search for exact grid coloring solutions and its implementation on a large-scale cluster ...
Daniel Apon, Wing Ning Li
openaire +1 more source
Grid-Oriented Scatter Search Algorithm
2009Scatter search (SS) is an evolutionary algorithm (EA) becoming more important in current researches as the increasing number of publications shows. It is a very promising method for solving combinatorial and nonlinear optimisation problems. This algorithm is being widely implemented for solving problems not taking long, but in case of processes ...
Antonio Gómez-Iglesias +4 more
openaire +1 more source
Similarity Grid for Searching in Metric Spaces
2005Similarity search in metric spaces represents an important paradigm for content-based retrieval of many applications. Existing centralized search structures can speed-up retrieval, but they do not scale up to large volume of data because the response time is linearly increasing with the size of the searched file.
Batko M, Gennaro C, Zezula P
openaire +1 more source
Moving target search in grid worlds
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, 2007In this paper, we propose a real-time moving target search algorithm for dynamic and partially observable environments, modeled as grid world. The proposed algorithm, Real-time Moving Target Evaluation Search (MTES), is able to detect the closed directions around the agent, and determine the best direction that avoids the nearby obstacles, leading to a
Cagatay Undeger, Faruk Polat
openaire +1 more source
Fuzzy Grid Scheduling Using Tabu Search
2007 IEEE International Fuzzy Systems Conference, 2007This paper considers the problem of grid scheduling in which different jobs are assigned to different processors, and a scheduling algorithm is devised, using tabu search, to find optimal solutions in order to maximize the number of scheduled jobs. However, inherent in the nature of the application, the processing times of jobs are not precise but are ...
Carole Fayad +2 more
openaire +1 more source
Local search for Grid scheduling [PDF]
, 2007 This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs.
Klusacek D +4 more
openaire +1 more source
Grid-Enabled Tabu Search for Electromagnetic Optimization Problems
IEEE Transactions on Magnetics, 2010The use of Grid Computing to solve electromagnetic optimization problems by means of the Tabu Search strategy is proposed in this paper. In order to significantly reduce the prohibitive computational cost of the numerical analyses required by the majority of iterative algorithms, two different grid-enabled Tabu Search strategies have been ported in the
CARCANGIU, SARA +3 more
openaire +2 more sources
SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID
International Journal of Foundations of Computer Science, 1993In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We define a similar problem which we call modified edge searching, and we derive a relation among the original edge searching problem and the modified one.
Symvonis, Antonios, Tragoudas, Spyros
openaire +1 more source
SHOP: Scaffold HOPping by GRID-Based Similarity Searches
Journal of Medicinal Chemistry, 2007A new GRID-based method for scaffold hopping (SHOP) is presented. In a fully automatic manner, scaffolds were identified in a database based on three types of 3D-descriptors. SHOP's ability to recover scaffolds was assessed and validated by searching a database spiked with fragments of known ligands of three different protein targets relevant for drug ...
Bergmann, Rikke +2 more
openaire +2 more sources