bodhiandphysics

7 ms·

31.
by bodhiandphysics 4y ago
you're right... its a condition... i have terrible spelling
32.
by bodhiandphysics 4y ago
So there’s an interesting prehistory to all this. The us music industry began in the late 19th century… and this is before the record! music publishing and songwriting was literally publishing… of the sheet music. The standard form of th
33.
by bodhiandphysics 4y ago
I didn’t notice in my glance through… but in general yeah, it’s a really weird survey
34.
by bodhiandphysics 4y ago
Does the book even mention B-splines or Nurbs? Subdivision?
35.
by bodhiandphysics 4y ago
stiffness has nothing to do with fp numbers... stiff equations are just as hard to solve using arbitrary precision bigints since the issue is the limits of approximations of the integral.
36.
by bodhiandphysics 4y ago
The thing about floating point numbers is that while they're not associative... they are approximately associative (mod inf and nan). In other words (ab)c = a(bc) + e where e is is a number much smaller than max(a,b,c). This means th
37.
by bodhiandphysics 4y ago
I think bellhead thinking would be putting the network stack on (a possibly virtual!) network card.
38.
by bodhiandphysics 4y ago
The distinction was more of a research thing... it was the distinction between bell labs' networking efforts and the various internet groups, and in some sense very specifically between people like Sandy Fraser (who did the research b
39.
by bodhiandphysics 4y ago
It really depends where. England ended serfdom in the 14th century, and in much of western europe (Italy notably, but also Scotland and Spain) serfdom never really developed. In central and eastern europe, peasants were ensurfed into the 1
40.
by bodhiandphysics 4y ago
Think about cryptography for a second…. In cryptography you need a problem that if you know the key is fast to decode but if you don’t is really slow… like you would have to search all the possibilities one by one. Such problems are (basic
41.
by bodhiandphysics 4y ago
You have to be careful what you mean by approximate. In this context, it means a schedule that requires more than the optimal number of pilots. Another way of meaning approximate is canceling routes till you can find a schedule that fits
42.
by bodhiandphysics 4y ago
I do simulated annealing for a living. Simulated annealing on graphs works great when a) the diameter of the graph is small (which for airlines corresponds to hubbie hub and spoke models) and b). when you can accept relatively approximate s
43.
by bodhiandphysics 4y ago
"Optimizing for subproblems" itself has issues. For instance with a single hub (a complete hub and spoke model), the problem is algorithmically easy. But a) flight distance is much higher, and b) you run the risk of a single wea
44.
by bodhiandphysics 4y ago
I'm sure they know exactly where every plane and every flight crew is at every moment. My point about algorithmic complexity is that even with perfect knowledge, fixing this is a computationally difficult problem. The idea was to show
45.
by bodhiandphysics 4y ago
One thing to note is that airline crew scheduling is np-hard (trivially you can reduce Hamiltonian cycle to it). Ak interesting semi-empiricle fact about np-complete problems. Take a decision problem to determine if there is a schedule wit
46.
by bodhiandphysics 4y ago
At extreme cost
47.
by bodhiandphysics 4y ago
There is of course one thing here that isn’t 15th century technology! Aluminum, which was unavailable before the early 20th century. Brass or silver are better choices (or silver plate on brass)
48.
by bodhiandphysics 4y ago
The graph has to be planar, which means no to edges intersect (or you can move the edges so that no two edges intersect). The complete graph with 5 or more vertices isn't planar.
49.
by bodhiandphysics 4y ago
in some sense because there might be strongly non-local effects... an assignment of color in one part of the graph can have an effect on what colors are allowed in a very different part of the graph. Planarity assures some degree of &quot
50.
by bodhiandphysics 4y ago
Tutte's are the central results in this work
51.
by bodhiandphysics 4y ago
This is in fact a very common proof strategy in combinatorics, often known as the probabalistic method. Naturally it was invented by Paul Erdos
52.
by bodhiandphysics 4y ago
I think a more likely reason why hunter gatherers don't have aren't prone to schizophrenia (in this model) is that it was evolutionarily bread out of them. Hunter gatherers in the modern world are extremely weird populations that
53.
by bodhiandphysics 4y ago
Logic programming and games actually go well together... inform (probably the most important text adventure engine) is notably a logic programming language. And many game engines have moved to an architecture in which game assets are repr
54.
by bodhiandphysics 4y ago
Major differences from Prolog seem to be as follows: Prolog always evaluates through unification (at least in theory). Verse is evaluated through reduction, including the unifications! This means a). there is a sublanguage in verse that
55.
by bodhiandphysics 4y ago
It is or... i.e x := (3 | 4) means x is either 3 or 4. The ; seems to be basically be an and. The evaluation finds an assignment of the values such that the world is true. For instance x:= (3 |4); (x % 2 = 1); x evaluates to 4. Type ch
56.
by bodhiandphysics 4y ago
As ray tracing becomes more common, I think we’ll see a big return of various BSP trees in games. BSP is still the crucial element in offline rendering.
57.
by bodhiandphysics 4y ago
The reason piece is good, but it glosses over some of the legal issues here. What is not at doubt is that Villarreal did not commit a crime. The texas law is either unconstitutionally vague, or doesn't apply to the kind of conduct th
58.
by bodhiandphysics 4y ago
He did it before he was at bell labs
59.
by bodhiandphysics 4y ago
You’re right!!! Acch...
60.
by bodhiandphysics 4y ago
Also in computer science.. a web sites page rank is the eigenvalue of the connectivity matrix.

More ›