Results 121 to 130 of about 334,287 (161)

Parallel search for Ramsey grid colorings

Proceedings of the 50th Annual Southeast Regional Conference, 2012
Monochromatic-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

Searching Simulation Scenarios on the Grid with ELSIGExplorer

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011
Grids became a commonplace for the computation of expensive numerical simulations. This work addresses the problem of searching for relevant simulations and for their results in a grid. This is challenging especially due to the large number of existing simulations, the small semantic differences between them, and the distributed nature of the grid ...
Ioan Lucian Muntean, Laura Maria Dansorean   +1 more
openaire   +1 more source

Similarity Grid for Searching in Metric Spaces

2005
Similarity 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, 2007
In 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

On a search problem in multidimensional grids

Journal of Statistical Planning and Inference, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruszinkó, Miklós, Tardos, Gábor
openaire   +2 more sources

Grid-based distributed search structure

Proceedings of the 44th annual Southeast regional conference, 2006
This 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

Grid-Oriented Scatter Search Algorithm

2009
Scatter 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, Miguel A. Vega-Rodríguez, Miguel Cárdenas-Montes, Enrique Morales-Ramos, Francisco Castejón-Magaña   +4 more
openaire   +1 more source

Grid-Based Interaction for Exploratory Search

2012
This paper presents a grid-based interaction model that is designed to encourage searchers to organize a complex search space by managing n ×m sub spaces. A search interface was developed based on the proposed interaction model, and its performance was evaluated by a user study carried out in the context of the NTCIR-9 VisEx Task.
Hideo Joho, Tetsuya Sakai
openaire   +1 more source

Range Searching in Categorical Data: Colored Range Searching on Grid

2002
Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are
Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan 0001   +2 more
openaire   +1 more source

Risky Search with Increasing Complexity by a Desktop Grid

2020
A common problem solved by high-performance computing is a search problem, when the unique object needs to be found among other objects. With a huge number of objects to examine and computationally hard examination of each, the search problem requires a lot of computing resources.
Ilya Chernov, Evgeny Ivashko
openaire   +1 more source