- Optimization algorithm used to find the values of parameters (coefficients) of a function (f) that minimizes a cost of function (cost).
- Used best when the parameters cannot be calculated analytically (linear algebra) and must be searched for by an optimization algorithm.
^
Start of line
$
End of line
.
Any single character except a line break.
[]
"Make it work, then make it beautiful, then if you really have to, make it fast. 90% of the time, if you make it beautiful, it will already be fast. So really, just make it beautiful." - Joe Armstrong
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Custom | |
-XX:-UseParallelGC | |
-XX:+UseJVMCICompiler | |
-XX:+OptimizeStringConcat | |
-XX:+UnlockExperimentalVMOptions | |
# GraalVM | |
-Dgraal.BitcodeOptimizations=true | |
# Default |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<templateSet group="EEx snippets"> | |
<template name="e=" value="<%= $END$ %>" description="EEx - Render Expression, replace with result" toReformat="true" toShortenFQNames="true"> | |
<context> | |
<option name="ELIXIR_CODE" value="true" /> | |
</context> | |
</template> | |
<template name="ee" value="<% $END$ %>" description="EEx - Expression, inline with output" toReformat="true" toShortenFQNames="true"> | |
<context> | |
<option name="ELIXIR_CODE" value="true" /> | |
</context> |
OlderNewer