Search Results for "b-tree implementation"

x
Sort By:

Showing 3 open source projects for "b-tree implementation"

View related business solutions
Physics Linux Clear Filters & Widen Search
  • Catch Bugs Before Your Customers Do Icon
    Catch Bugs Before Your Customers Do

    Real-time error alerts, performance insights, and anomaly detection across your full stack. Free 30-day trial.

    Move from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
    Try AppSignal Free
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
    Start Free
  • 1

    RSchr-5

    Solves one-electron Schrödinger equation, with SLEPc and PETSc

    ...The solved problem is defined on the finite domain, which is a box. The problem is solved with the zero Dirichlet boundary conditions. The implemented algorithm uses Finite Element Method with B-splines as basis functions. Disctretization leads to generalized eigenvalue problem. Program RSchr-5 solves the generalized eigenvalue problem by algorithms implemented in SLEPc amd PETSc libraries. It uses Krylov-Schur algorithm from SLEPc library. The program is implemented in C++. The implementation is based on Message Passing Interface (MPI).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    (We have migrated this project to github [June 1 2015)] http://github.com/msg-byu/enumlib). The source files have been removed from sourceforge. Go to github (link above) for the latest copy. <<<< OLD SUMMARY >>>> A Fortran 95 implementation of an algorithm for generating derivative structures of a parent lattice. The algorithm is discussed in detail in: Gus L. W. Hart and Rodney W. Forcade, "Algorithm for generating derivative structures," Phys. Rev. B 77 224115 (26 June 2008) http://msg.byu.edu/papers/GLWHart_enumeration.pdf Gus L. W. Hart and Rodney W. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    a C++ template container implementation of k-dimensional space sorting based on the kd-tree data structure. THIS PROJECT HAS MOVED TO ALIOTH.DEBIAN.ORG
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next

Related Categories

MongoDB Logo MongoDB