Results 281 to 290 of about 348,888 (311)
Some of the next articles are maybe not open access.
Risky Search with Increasing Complexity by a Desktop Grid
2020A 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
Modified Grid Searches for Hyper-Parameter Optimization
2020Black-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 +2 more
openaire +1 more source
A High Throughput Approach to Combinatorial Search on Grids
2006 15th IEEE International Conference on High Performance Distributed Computing, 2006Current distributed combinatorial search algorithms assume the use of managed or reserved resources. However, grid resources are shared and exhibit highly dynamic availability. Accommodating these resources in runtime collaboration for distributed search applications is a challenge.
Yan Liu 0009 +2 more
openaire +1 more source
Genealogies of the Grid: Revisiting Stanislawski's Search for the Origin of the Grid–Pattern Town*
Geographical Review, 2008This chapter provides a genealogy of the grid and a critical reassessment of the limitations of Stanislawski’s theory of the grid’s origin as a means of challenging the doctrine of geographical diffusionism more generally. It then offers a selective overview of recent approaches to understanding the grid and calls for a comparative genealogy of gridded
openaire +1 more source
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.
Antonios Symvonis, Spyros Tragoudas
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 +2 more sources
Accelerating HMMER search using FPGA Grid
2012HMMER 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.
Toyokazu Takagi, Tsutomu Maruyama
openaire +1 more source
Pegasus and the Pulsar Search: From Metadata to Execution on the Grid
2004This paper describes the Pegasus workflow mapping and planning system that can map complex workflows onto the Grid. In particular, Pegasus can be configured to generate an executable workflow based on application-specific attributes. In that configuration, Pegasus uses and AI-based planner to perform the mapping from high-level metadata descriptions to
Ewa Deelman +8 more
openaire +2 more sources
Grid enabled optimisation and design search (GEODISE) [PDF]
, 2002 During the process of optimisation and design search, the modelling nad analysis of engineering problems are exploited to yield improved designs. The engineer explores various design parameters that he wishes to optimise and a measure of the quality of a particular design (the objective function) is computed using an appropriate model.
Cox, S.J. +14 more
openaire +1 more source