• Tabu search

  • Referenced in 1079 articles [sw08556]
  • useful aspects of tabu search is the ability to adapt a rudimentary prototype implementation ... types of constraints and objective functions. Similarly, the method itself can be evolved to varying ... illustrate the strategic concerns of tabu search, and to show how they may be exploited...
  • SIMPLIcity

  • Referenced in 87 articles [sw14893]
  • permitting semantically-adaptive searching methods and narrowing down the searching range in a database ... measure for the overall similarity between images is developed using a region-matching scheme that...
  • SS-Wrapper

  • Referenced in 2 articles [sw30878]
  • similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search ... search) approach to parallelize sequence database search applications. It takes into consideration load balancing between ... resource usage. QS-search is designed to wrap many different search tools, such as BLAST ... provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments...
  • Zeno

  • Referenced in 11 articles [sw07735]
  • have adapted known, and developed new, heuristics for the reduction of the search space ... function definitions, and avoid the repetition of similar proof steps.par We compare with the rippling...
  • LPG

  • Referenced in 12 articles [sw20690]
  • both plan generation and plan adaptation problems. The basic search scheme of LPG was inspired ... efficient procedure to solve SAT-problems. The search space of LPG consists of ”action graphs ... search using discrete Lagrange multipliers. The evaluation function uses some heuristics to estimate the ”search ... switch to best-first search after a certain number of search steps and ”restarts” have...
  • GGSA

  • Referenced in 5 articles [sw18531]
  • Gravitational Search Algorithm for data clustering. Gravitational Search Algorithm (GSA) is a stochastic population-based ... exploitation abilities. In this paper, we adapt the structure of GSA for solving the data ... each cluster share a high degree of similarity while being very dissimilar to data from...
  • cosmo

  • Referenced in 3 articles [sw06106]
  • conserved motifs in DNA sequences. cosmo searches a set of unaligned DNA sequences ... transcription factor binding site. The algorithm is similar to MEME, but also allows the user ... appropriate constraint set can be selected data-adaptively...
  • GridBlast

  • Referenced in 3 articles [sw09666]
  • search technique that is embarrassingly parallel in nature and thus amenable to adaptation ... template for the development of similar applications. The application has been tested on a ‘mini...
  • ISPAES

  • Referenced in 1 article [sw02502]
  • similar way PAES does it, but here the grid is adaptable, this is, its size ... accordingly to the constraints and adapts to the search space once the population reaches...
  • CLOVER

  • Referenced in 2 articles [sw33619]
  • server. Most leaves tend to have similar color and texture, which makes shape-based image ... search to reduce the matching time. We implemented a prototype system that supports adaptive transmission...
  • Symmetric NMTF

  • Referenced in 1 article [sw42109]
  • method with exact line search (GM-ELS) and the adaptive moment estimation method (ADAM ... generated, while the others represent real-life similarities between different objects. Extensive numerical results show...
  • ColBERT

  • Referenced in 1 article [sw37760]
  • ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT. Recent progress ... present ColBERT, a novel ranking model that adapts deep LMs (in particular, BERT) for efficient ... interaction step that models their fine-grained similarity. By delaying and yet retaining this fine ... pruning-friendly interaction mechanism enables leveraging vector-similarity indexes for end-to-end retrieval directly...
  • ACORD

  • Referenced in 1 article [sw03097]
  • problem. The first algorithm was aiming to search for an optimal path in a graph ... derived methods have been adapted to dynamic problems in real variables, stochastic problems, multi-targets ... elements are solutions to a given problem. Similar studies, without using Ant Colonies, have been...
  • CSDP

  • Referenced in 206 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

  • Referenced in 3221 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • LAPACK

  • Referenced in 1713 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Maple

  • Referenced in 5403 articles [sw00545]
  • The result of over 30 years of cutting...
  • MapReduce

  • Referenced in 267 articles [sw00546]
  • MapReduce is a new parallel programming model initially...
  • Mathematica

  • Referenced in 6445 articles [sw00554]
  • Almost any workflow involves computing results, and that...