With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Save Up to 91% on Cloud Compute With Spot VMs
Automatic sustained-use discounts. One free VM per month. No negotiation needed.
Run batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
Este projeto objetiva a criação de um Toolbox para utilização de algoritmos de Computação Bioinspirada. O Toobox oferece uma vasta coleção de algoritmos de ferramentas para o projeto de Algoritmos Genéticos e Redes Neurais.
Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.
The Tomographic Image Reconstruction Interface of the Universite de Sherbrooke (TIRIUS) is a Qt-based user-interface software for reconstructing 3D images from data generated by real apparatus or generated by the GATE Monte Carlo simulator.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Crazy Turtle puzzle game solver utility. Other names: CRAZY TURTLE / LE JEU FOU DE LA TORTUE / NAUGHTY TURTLES / ŠAŠAVE KORNJAČE / NAGAJIVE ŽELVICE / SASAVE KORNJACE
PortugolViana é uma ferramenta open-source para edição/execução algorítmica. PortugolViana permite a edição de algoritmos em português (do Brasil e de Portugal) e a sua execução e monitorização.
It is useful to understand how hamming coding running is in network layer on TCP/IP protocol [TÜRKÇE] OSI ve TCP/IP de ağ katmanında kullanılan hamming kodlamasının nasıl işlediğini gösteren eğitim amaçlı bir uygulamadır.
Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Esta é a documentação de um projeto de conclusão de curso feito na conclusão do curso de Engenharia de Computação-UNIVALI.É um conjunto de arquivos C e Matlab contendo a implementação da Lógica Fuzzy e simulações em sistema de enegia.
Java Component created to persist and work with trees (it doesn't matter the type of persistence). Based on "Nested Set Model of Hierarchies" by Joe Celko. [Componente Java para persistir y trabajar con árboles (no importa el tipo de persistencia)]
There you will find my works of different sets of asm libs like "Still Mpeg Assembly Decompressor" , "LZW16 compressor & decompressor for lzw16 & gif" , "Lzss de/compressor similiar to aplib,upx etc but faster&better de/compression" , "Jpeg decode lib" ,
High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)
...b. Descripción de los costes computacionales y requisitos
tecnológicos.
c. Manual de usuario del programa desarrollado.
FASES
1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto).
2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos)
(límite: 23 de mayo).
3. Presentación del trabajo (2 puntos) (28 de mayo).
RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.