Results 301 to 310 of about 980,436 (340)
Some of the next articles are maybe not open access.
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
SEARCHING METHODS FOR RAPID GRID INTERPOLATION∗
The Professional Geographer, 1989A 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), 2005This 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
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.
Takagi Toyokazu, Maruyama Tsutomu
openaire +1 more source
Grid-Based Interaction for Exploratory Search
2012This 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