User contributions for Admin
Jump to navigation
Jump to search
10 April 2023
- 07:5307:53, 10 April 2023 diff hist +4 Radius No edit summary current
- 07:5307:53, 10 April 2023 diff hist +4 Median No edit summary current
- 07:5307:53, 10 April 2023 diff hist +1 OV No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 MaxSAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Dual-Horn SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +4 Renamable Horn No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Horn SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 XOR-SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Monotone 3SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 4SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 3SAT-5 No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 3SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +46 K-SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 2SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 All-Equal-SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Not-All-Equal 3-SAT (NAE 3SAT) No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Monotone Not-Exactly-1-in-3SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 1-in-3SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Monotone 1-in-3SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Conjunctive Normal Form SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 Disjunctive Normal Form SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2 SAT No edit summary current
- 07:5307:53, 10 April 2023 diff hist −288 5-Graph Coloring No edit summary current
- 07:5307:53, 10 April 2023 diff hist −193 4-Graph Coloring No edit summary
- 07:5307:53, 10 April 2023 diff hist −192 3-Graph Coloring No edit summary
- 07:5307:53, 10 April 2023 diff hist −288 2-Graph Coloring No edit summary current
- 07:5307:53, 10 April 2023 diff hist −288 Chromatic Number No edit summary current
- 07:5307:53, 10 April 2023 diff hist −286 K-Graph Coloring No edit summary current
- 07:5307:53, 10 April 2023 diff hist +58 Link Analysis No edit summary
- 07:5307:53, 10 April 2023 diff hist +492 N No-Steal, Force Created page with "{{DISPLAYTITLE:No-Steal, Force (Recovery)}} == Description == Recovery is the process of reverting back to a safe state prior to a system failure. With a No-Steal/Force policy, the recovery algorithm will never write uncommited data to memory, but will force all commits to memory. == Related Problems == Related: Steal, No-Force == Parameters == $n$: number of transactions before crash == Table of Algorithms == Currently no algorithms in our database for t..." current
- 07:5307:53, 10 April 2023 diff hist +829 N Steal, No-Force Created page with "{{DISPLAYTITLE:Steal, No-Force (Recovery)}} == Description == Recovery is the process of reverting back to a safe state prior to a system failure. With a Steal/No-Force policy, the recovery algorithm will write possibly uncommited data to memory, while not forcing all commits to memory. == Related Problems == Related: No-Steal, Force == Parameters == $n$: number of transactions before crash == Table of Algorithms == {| class="wikitable sortable" style="t..."
- 07:5307:53, 10 April 2023 diff hist +51 Online No edit summary
- 07:5307:53, 10 April 2023 diff hist +51 Offline No edit summary
- 07:5307:53, 10 April 2023 diff hist +2 Dining Philosophers Problem No edit summary current
- 07:5307:53, 10 April 2023 diff hist +4 Deadlock Avoidance No edit summary current
- 07:5307:53, 10 April 2023 diff hist +48 Weighted Interval Schedule Maximization Problem (ISMP) No edit summary current
- 07:5307:53, 10 April 2023 diff hist +2,975 N Unweighted Interval Scheduling, Online Created page with "{{DISPLAYTITLE:Unweighted Interval Scheduling, Online (Interval Scheduling)}} == Description == Given are $n$ intervals of the form $(s_j , f_j)$ with $s_j < f_j$, for $j = 1, \ldots , n$. These intervals are the jobs that require uninterrupted processing during that interval. We will assume (without loss of generality) that the $s_j$’s and the $f_j$’s are nonnegative integers. We say that two intervals (or jobs) overlap if their intersection is nonempty, otherwise..."
- 07:5307:53, 10 April 2023 diff hist +37 Unweighted Interval Scheduling No edit summary current
- 07:5307:53, 10 April 2023 diff hist +27 Greatest Common Divisor No edit summary
- 07:5307:53, 10 April 2023 diff hist +4 Polynomial Interpolation No edit summary
- 07:5307:53, 10 April 2023 diff hist +4 Block Ciphers No edit summary current
- 07:5307:53, 10 April 2023 diff hist +105 Solutions to Nonlinear Equations No edit summary
- 07:5307:53, 10 April 2023 diff hist +36 Secret Sharing No edit summary
- 07:5307:53, 10 April 2023 diff hist 0 Unkeyed Hash Functions No edit summary current
- 07:5307:53, 10 April 2023 diff hist 0 Keyed Hash Functions No edit summary current
- 07:5307:53, 10 April 2023 diff hist −11 The Frequent Words Problem No edit summary
- 07:5207:52, 10 April 2023 diff hist −1,342 K Approximate Nearest Neighbors Search No edit summary current
- 07:5207:52, 10 April 2023 diff hist +764 N Root Computation with continuous first derivative Created page with "{{DISPLAYTITLE:Root Computation with continuous first derivative (Root Computation)}} == Description == Given a real function with continuous first derivative, compute one of the roots. == Related Problems == Related: General Root Computation == Parameters == $\epsilon$: (additive) tolerance error $a, b$: endpoint values, with $b>a$ $n_{max}$: maximum number of iterations == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;"..." current
- 07:5207:52, 10 April 2023 diff hist +64 K Nearest Neighbors Search No edit summary current