Name
Abstract | ||
|---|---|---|
A fine line divides "not bad and useful" from "wildly wrong" when it comes to easy approximations for hard-to-compute problems. Monte Carlo methods sometimes play a role slightly similar to the old-time tricks of estimation. However, instead of merely checking a result's plausibility, researchers also use Monte Carlo to estimate things that are impossible to compute exactly. A standard way to introduce several fundamental techniques of algorithm design using the notion of topological sorting. Wikipedia gives pseudo code for two ways of generating a topological sort. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/MCSE.2010.139 | Computing in Science and Engineering |
Keywords | Field | DocType |
Monte Carlo methods,directed graphs,sorting,Monte Carlo methods,Wikipedia,topological sorting notion,Monte Carlo,Rapid approximation,topological sort | Monte Carlo method,Algorithm design,Topological sorting,Computer science,Directed graph,Approximation theory,Algorithm,Theoretical computer science,Pseudo-code,Sorting,Algorithm theory | Journal |
Volume | Issue | ISSN |
12 | 6 | 1521-9615 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francis Sullivan | 1 | 0 | 0.34 |