Results 261 to 270 of about 984,534 (293)

SEARCHING METHODS FOR RAPID GRID INTERPOLATION∗

The Professional Geographer, 1989
A widely used method for grid interpretation from a set of discrete sample points is based on the inverse distanceweighted model. This method requires the identification of k-nearest sample points for each grid point, probably the most time-consuming portion of the grid interpolation process. Three searching methods for identifying the k-nearest sample
openaire   +1 more source

P2P-Based Grid Architecture for Homology Searching

Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 2005
This paper describes an advanced grid architecture efficient for homology searching in bioinformatics. An integrated architecture of the computing-grid and data-grid through P2P communication attains efficient job processing. Field trials, in which broadband users and bioinformatics researchers participated to find new DNAs, show its effectiveness in ...
H. Sunaga, T. Oka, K. Ueda, H. Matsumura
openaire   +1 more source

Accelerating HMMER search using FPGA Grid

2012
HMMER is one of the most used software tools for sensitive profile HMM searches of biological sequence databases. HMMER can be accelerated by comparing a profile HMM with sequences in parallel using a CPU grid. HMMER is, however, still a cpu-intensive program.
Takagi Toyokazu, Maruyama Tsutomu
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

Modified Grid Searches for Hyper-Parameter Optimization

2020
Black-box optimization aims to find the optimum of an unknown function only by evaluating it over different points in the space. An important application of black-box optimization in Machine Learning is the computationally expensive tuning of the hyper-parameters, which requires to try different configurations and measure the validation error over each
David López, Carlos M. Alaíz, José R. Dorronsoro   +2 more
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   +2 more
openaire   +1 more source

Grid search in hyperparameter optimization of machine learning models for prediction of HIV/AIDS test results

International Journal of Computers and Applications, 2022
Daniel Mesafint Belete
exaly  

Grid Search for ARIMA

2023
openaire   +1 more source

Metaheuristic search in smart grid: A review with emphasis on planning, scheduling and power flow optimization applications

Renewable and Sustainable Energy Reviews, 2021
Marios Stogiannos, Alex Alexandridis
exaly  

Heuristic algorithms for reliability estimation based on breadth-first search of a grid tree

Reliability Engineering and System Safety, 2023
Zhifeng Xu, Yushun Wu
exaly