並び順

ブックマーク数

期間指定

  • から
  • まで

1 - 10 件 / 10件

新着順 人気順

divide and conquer algorithm code exampleの検索結果1 - 10 件 / 10件

  • Continuous reinvention: A brief history of block storage at AWS

    Continuous reinvention: A brief history of block storage at AWSAugust 22, 2024 • 4802 words Marc Olson has been part of the team shaping Elastic Block Store (EBS) for over a decade. In that time, he’s helped to drive the dramatic evolution of EBS from a simple block storage service relying on shared drives to a massive network storage system that delivers over 140 trillion daily operations. In thi

      Continuous reinvention: A brief history of block storage at AWS
    • MAI-Thinking-1: Building a Hill-Climbing Machine

      MAI-Thinking-1: Building a Hill-Climbing Machine The Microsoft AI Team 1 Abstract Progress in AI is driven not by a single model, but by the ability to continually improve upon the current state of models. Achieving this requires treating model development as a system-level optimization problem, for which the solution is building a hill-climbing machine for rapid improvement. Our process includes

      • Annotated history of modern AI and deep neural networks

        For a while, DanNet enjoyed a monopoly. From 2011 to 2012 it won every contest it entered, winning four of them in a row (15 May 2011, 6 Aug 2011, 1 Mar 2012, 10 Sep 2012).[GPUCNN5] In particular, at IJCNN 2011 in Silicon Valley, DanNet blew away the competition and achieved the first superhuman visual pattern recognition[DAN1] in an international contest. DanNet was also the first deep CNN to win

          Annotated history of modern AI and deep neural networks
        • FoundationDB: A Distributed Key-Value Store – Communications of the ACM

          FoundationDB is an open-source transactional key-value store created more than 10 years ago. It is one of the first systems to combine the flexibility and scalability of NoSQL architectures with the power of ACID transactions. FoundationDB adopts an unbundled architecture that decouples an in-memory transaction management system, a distributed storage system, and a built-in distributed configurati

          • Glidesort - FOSDEM 2023

            Glide. Vultur gryphus, Hugo Pédel CC BY-SA 3.0 Glidesort Orson Peters Research done at CWI Database Architectures group Efficient In-Memory Adaptive Stable Sorting on Modern Hardware What is glidesort? ● General purpose stable comparison sort. ● A hybrid of mergesort, quicksort and block insertion sort. ● Robustly adaptive to pre-sorted and low-cardinality inputs. ● Reference implementation in (unsa

            • Algebraic Path Finding

              There’s something magical about polymorphic algorithms. Really, isn’t it awesome to write a piece of code once and then just tweak the meaning of some inputs to solve another seemly unrelated problem? Let’s see an example of those with applications ranging from regular expressions to matrix inversion, with a lot of useful queries on graphs along the way. Today we will continue our explorations in

                Algebraic Path Finding
              • Sorting Algorithms - LAMFO

                Posted by Leonardo Galler and Matteo Kimura on April 21, 2019 What are Sorting Algorithms? Sorting algorithms are ways to organize an array of items from smallest to largest. These algorithms can be used to organize messy data and make it easier to use. Furthermore, having an understanding of these algorithms and how they work is fundamental for a strong understanding of Computer Science which is

                • research!rsc: Hash-Based Bisect Debugging in Compilers and Runtimes

                  Setting the Stage Does this sound familar? You make a change to a library to optimize its performance or clean up technical debt or fix a bug, only to get a bug report: some very large, incomprehensibly opaque test is now failing. Or you add a new compiler optimization with a similar result. Now you have a major debugging job in an unfamiliar code base. What if I told you that a magic wand exists

                  • GitHub - ComfyUI-Workflow/awesome-comfyui: A collection of awesome custom nodes for ComfyUI

                    ComfyUI-Gemini_Flash_2.0_Exp (⭐+172): A ComfyUI custom node that integrates Google's Gemini Flash 2.0 Experimental model, enabling multimodal analysis of text, images, video frames, and audio directly within ComfyUI workflows. ComfyUI-ACE_Plus (⭐+115): Custom nodes for various visual generation and editing tasks using ACE_Plus FFT Model. ComfyUI-Manager (⭐+113): ComfyUI-Manager itself is also a cu

                      GitHub - ComfyUI-Workflow/awesome-comfyui: A collection of awesome custom nodes for ComfyUI
                    • Looking inside ROScribe and the idea of LLM-based robotic platform

                      ROScribe ROScribe is an open source tool that uses LLM for software generation in robotics within ROS (Robot Operating System) framework. ROScribe supports both ROS 1 and ROS 2 with python implementations. In this post, I want to dive deep into how ROScribe works under the hood, and explain some high level ideas behind this project. Further, I want to discuss how using LLM for code generation in a

                        Looking inside ROScribe and the idea of LLM-based robotic platform
                      1