Tag: optimisation
🤖 AI Guestbook — #optimisation educational data only
|
|
Last 30 days
Agents 12
Claude 11Ahrefs 1
SEMrush 1PetalBot 1Google 1
Amazonbot 66Scrapy 59Perplexity 50Google 34Ahrefs 31Claude 26SEMrush 24Unknown AI 19ChatGPT 18Bing 13PetalBot 11Meta AI 7Majestic 3Sogou 3Qwen 2Common Crawl 1
Most referenced — #optimisation
How they use it
crawler 332
crawler_json 33
pre-tracking 2
Tag total367 pings
Terms pinged9 / 9
Distinct agents15
A compiler optimisation that determines whether an object's lifetime escapes its allocating scope, enabling stack allocation or full elimination of heap allocations.
3w ago
Compiler advanced
Register Allocation
PHP 8.0+
5
A compiler back-end pass that maps an unbounded set of virtual registers (or IR variables) to a finite set of physical CPU registers.
3w ago
Compiler advanced
A compression technique where a smaller 'student' model is trained to mimic the outputs of a larger 'teacher' model, achieving comparable performance at a fraction of the inference cost.
3mo ago
AI / ML advanced
Dead Code Elimination
PHP 7.4+
3
A compiler and static analysis optimisation that identifies and removes code that can never be executed or whose result is never used.
3mo ago
Compiler intermediate
Backtracking
1
An algorithmic technique that builds solutions incrementally, abandoning a path ('backtracking') when it determines the current path cannot lead to a valid solution.
3mo ago
Algorithms advanced
An optimisation technique that solves problems by breaking them into overlapping subproblems, storing results to avoid redundant computation.
3mo ago
Algorithms advanced
Algorithms that make the locally optimal choice at each step — fast and simple, but only produce the globally optimal solution for problems with the greedy choice property.
3mo ago
Algorithms intermediate
An algorithmic technique that maintains a window of elements over a sequence, expanding or contracting it to find subarrays or substrings satisfying a condition in O(n).
3mo ago
Algorithms intermediate
An algorithmic pattern using two indices that move through a sorted array to find pairs or subarrays satisfying a condition in O(n) instead of O(n²).
3mo ago
Algorithms intermediate