Explore >> Select a destination
|
You are here 
|
opentofu.org | ||
| | | | |
bloeys.com
|
|
| | | | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | |
| | | | |
opensource.org
|
|
| | | | | Introduction Open source doesnt just mean access to the source code. The distribution terms of open source software must comply with the following criteria: 1. Free Redistribution The license shall | |
| | | | |
www.morling.dev
|
|
| | | | | As a software engineer, I like to automate tedious tasks as much as possible. The deployment of this website is no exception: it is built using the Hugo static site generator and hosted on GitHub Pages; so wouldn't it be nice if the rendered website would automatically be published whenever an update is pushed to its source code repository? | |
| | | | |
francisbach.com
|
|
| | | [AI summary] This text discusses the scaling laws of optimization in machine learning, focusing on asymptotic expansions for both strongly convex and non-strongly convex cases. It covers the derivation of performance bounds using techniques like Laplace's method and the behavior of random minimizers. The text also explains the 'weird' behavior observed in certain plots, where non-strongly convex bounds become tight under specific conditions. The analysis connects theoretical results to practical considerations in optimization algorithms. | ||
