User contributions for Rice
From Rice Wiki
15 April 2024
- 15:3315:33, 15 April 2024 diff hist +189 N FISC Created page with "= Supoperator = Since there are free bits in ''NOT'', we can assign more sub operators as long as they take less than 3 registers. * ASR" Tag: Visual edit
- 15:3315:33, 15 April 2024 diff hist +246 N ASR Created page with "'''Arithmetic shift right (ASR)''' is a single-register instruction. ''ASR rd'' It shifts the destination register to the right by one bit, assigning 0 to the lowest bit. Notably, it is a ''no-delay'' circuit. Category:Computer Architecture" current Tag: Visual edit
- 15:2815:28, 15 April 2024 diff hist +194 N ALU Created page with "= Suboperator = Sometimes, free bits in an instruction allows for suboperator. This involves additional parsing on the circuit, such as another MUX under NOT." Tag: Visual edit
- 15:2215:22, 15 April 2024 diff hist +548 Instructions (Computer Science) No edit summary Tag: Visual edit
8 April 2024
- 21:1321:13, 8 April 2024 diff hist +2,865 Ordinary differential equation Removed redirect to Ordinary Differential Equation Tag: Removed redirect
- 21:1321:13, 8 April 2024 diff hist +44 N Ordinary differential equation Rice moved page Ordinary Differential Equations to Ordinary Differential Equation Tag: New redirect
- 21:1221:12, 8 April 2024 diff hist +410 N Linear first order ODE Created page with "Category:Differential Equations '''Linear first order Ordinary_Differential_Equation''' Homogeneous of g(t) = 0 Constant coefficient if p(t) = a is a constant. Otherwise, variable coefficient. Examples: y' + ty = 2 nonhomogeneous, var y' + 2y = 2 nonhomogeneous, constant y' + 2y = 0 homogeneous, constant Factor emthod 2.1 y' + p(t) y = g(t) Compute integrating factor mu(t) = exp(int p(t) dt)"
- 20:0920:09, 8 April 2024 diff hist +33 Pathfinder 2e/Encounter No edit summary current Tag: Visual edit
- 19:4419:44, 8 April 2024 diff hist +46 N Pathfinder 2e/Encounter Created page with "When moments matter, use '''encounter mode'''."
- 19:4319:43, 8 April 2024 diff hist +1 Topic: Pathfinder 2e No edit summary current
- 19:4319:43, 8 April 2024 diff hist +7 Topic: Pathfinder 2e No edit summary
- 19:4219:42, 8 April 2024 diff hist +54 Topic: Pathfinder 2e No edit summary
- 19:4219:42, 8 April 2024 diff hist +39 N Godot/Key Concepts Rice moved page Godot/Key Concepts to Topic: Godot/Key Concepts current Tag: New redirect
- 19:4219:42, 8 April 2024 diff hist 0 m Topic: Godot/Key Concepts Rice moved page Godot/Key Concepts to Topic: Godot/Key Concepts current
- 19:4219:42, 8 April 2024 diff hist +26 N Godot Rice moved page Godot to Topic: Godot current Tag: New redirect
- 19:4219:42, 8 April 2024 diff hist 0 m Topic: Godot Rice moved page Godot to Topic: Godot current
- 19:4119:41, 8 April 2024 diff hist +210 N Topic: Pathfinder 2e Created page with "This page contains information about '''Pathfinder 2e''', the TTRPG that's better than D&D. Most information comes from [https://2e.aonprd.com/ Archives of Nethys], and mostly to pay attention while reading it." Tag: Visual edit
- 18:5418:54, 8 April 2024 diff hist +859 Curve fitting No edit summary Tag: Visual edit
- 18:4018:40, 8 April 2024 diff hist +1,560 N Curve fitting Created page with "'''Curve fitting''' is the process of defining/determining (''fit'') a function (''curve'') that best approximates the relationship between dependent and independent variables. * '''Underfitting''' is when models are too basic * '''Overfitting''' is when models are too complex, which may lead to incorrect predictions for values outside of the training data. = Underfitting = Visualize the fit of the model on the test data and bias variance tradeoff. If a model has ''hi..." Tag: Visual edit
- 18:3118:31, 8 April 2024 diff hist +87 N File:BiasVarianceTradeoff-scott fortmann-roe com.png No edit summary current
5 April 2024
- 18:1118:11, 5 April 2024 diff hist +445 Exploratory data analysis →Outlier Tag: Visual edit
- 17:3817:38, 5 April 2024 diff hist +340 Bivariate →Correlation current Tag: Visual edit
- 17:2617:26, 5 April 2024 diff hist +40 Bivariate →Correlation Tag: Visual edit
3 April 2024
- 18:5118:51, 3 April 2024 diff hist +29 N Category:Machine Learning Created page with "Category:Computer Science" current Tag: Visual edit
- 18:5118:51, 3 April 2024 diff hist +556 Machine Learning →Constructing ML Models Tag: Visual edit
- 18:4118:41, 3 April 2024 diff hist +755 Exploratory data analysis No edit summary Tag: Visual edit
- 18:1618:16, 3 April 2024 diff hist +176 Exploratory data analysis No edit summary Tag: Visual edit
- 18:1318:13, 3 April 2024 diff hist +267 N Exploratory data analysis Created page with "'''Exploratory data analysis (EDA)''' is the first step in the Machine Learning pipeline. It allows us to make informed decisions about tools used to analyze the data. * Look at features of data * Look at correlated features * Find trends and unusual characteristics" Tag: Visual edit
- 18:1118:11, 3 April 2024 diff hist +30 Machine Learning No edit summary Tag: Visual edit
- 18:1118:11, 3 April 2024 diff hist −31 Machine Learning No edit summary Tag: Visual edit
2 April 2024
- 07:0107:01, 2 April 2024 diff hist +100 Endianess No edit summary Tag: Visual edit
- 07:0007:00, 2 April 2024 diff hist +152 Endianess No edit summary Tag: Visual edit
- 06:5506:55, 2 April 2024 diff hist +736 N Endianess Created page with "CPUs operate on a group of bits called a ''word''. A 32-bit CPU has a 32 bit (4 byte) word size. '''Endianess''' is the choice of order when storing multiple bytes of a word across memory. There are two choices: Big Endian and Little Endian. Consider storing 0x10203040 in a 32-bit machine In '''Big Endian''', the most significant byte is stored at the lowest part of an address (i.e. big end first). Addresses would look something like 0x10, 0x20, 0x30, 0x40. BE is used..." Tag: Visual edit
1 April 2024
- 18:4318:43, 1 April 2024 diff hist +532 Machine Learning No edit summary Tag: Visual edit
- 18:3818:38, 1 April 2024 diff hist +431 Machine Learning No edit summary Tag: Visual edit
- 18:2818:28, 1 April 2024 diff hist +296 N Machine Learning Created page with "Rule-based systems follows a set of pre-defined rules defined by experts to cover all scenarios to automate the decision making process. This is not sufficient for complex systems. '''Machine learning (ML)''' builds models to identify and predict patterns, make decisions, and automate processes." Tag: Visual edit
- 15:3215:32, 1 April 2024 diff hist +120 N Instructions (Computer Science) Created page with "A computer needs 1 instruction to run (OISC with subleq). It's possible but not fun. Category:Computer Architecture" Tag: Visual edit
20 March 2024
- 18:0618:06, 20 March 2024 diff hist −140 Kruskal's Algorithm →Kruskal's Algorithm current Tag: Visual edit
- 18:0618:06, 20 March 2024 diff hist +112 Kruskal's Algorithm No edit summary Tag: Visual edit
- 18:0618:06, 20 March 2024 diff hist +71 Kruskal's Algorithm →Analysis Tag: Visual edit
- 18:0518:05, 20 March 2024 diff hist +284 Kruskal's Algorithm →Analysis Tag: Visual edit
- 18:0018:00, 20 March 2024 diff hist +20 Kruskal's Algorithm →Approach: Greedy Tag: Visual edit
- 17:5917:59, 20 March 2024 diff hist +133 Kruskal's Algorithm →Approach: Greedy Tag: Visual edit
- 17:5617:56, 20 March 2024 diff hist +426 Prims Algorithm →Analysis current Tag: Visual edit
- 17:4717:47, 20 March 2024 diff hist +161 Prims Algorithm →Approach: Greedy Tag: Visual edit
- 17:4217:42, 20 March 2024 diff hist +376 Kruskal's Algorithm →Approach Tag: Visual edit
- 17:4117:41, 20 March 2024 diff hist +424 Prims Algorithm →Approach: Greedy Tag: Visual edit
- 17:4017:40, 20 March 2024 diff hist −478 Minimum Spanning Tree →Approach: Greedy current Tag: Visual edit
- 17:3417:34, 20 March 2024 diff hist +337 BFS →Analysis current Tag: Visual edit
- 17:2417:24, 20 March 2024 diff hist +1,402 N BFS Created page with "{{Infobox Algorithm|runtime=O(V+E)|class=Graph Algorithm}} '''Breadth-first search (BFS)''' is a graph traversal algorithm. = Approach = At the core of BFS is a ''priority queue'' of unvisited nodes''.'' # At the start, the source node has a distance of 0, whereas the rest has infinite distance. The source node is pushed into the queue. # The queue is popped as the first node in the queue is visited. # Upon visiting a node, if the node's distance is infinity (i.e...." Tag: Visual edit
