Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
idunning
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
12 ms
·
91.
▲
by
idunning
12y ago
I guess what I'm getting at is a GA with 100% mutation is basically randomly generating solutions and evaluating them. Now, no one does that, but if your GA eventually explores a large amount of the search space in order to get a good
92.
▲
by
idunning
12y ago
One thing to watch out with these sorts of approaches is you are actually improving on an exhaustive search of all possibilities (perhaps with some smart pruning).
93.
▲
Julia Package Ecosystem Dependency Graphs
(iaindunning.com)
2 points
by
idunning
12y ago
|
0 comments
94.
▲
by
idunning
12y ago
Comprehensive! Covers the Lisp-y influences of Julia in great depth. My perspective on Julia is that it has 3 ingredients: 1. A principled design that derives from the experiences of past programming language and particularly the creator&#x
95.
▲
by
idunning
12y ago
"Nurse scheduling competitions" seem to alternate between IP and CP approaches - my feeling is that when the number of solutions is "small", CP pulls ahead, but when there are many solutions and the objective is importan
96.
▲
by
idunning
12y ago
I don't think it truly qualifies as an expert system because, to the best I can determine from this limited article, it doesn't make any inferences from a base set of rules. Rather, it is provided with a comprehensive set of all r
97.
▲
by
idunning
12y ago
This seems like a pretty standard application of scheduling/optimization/operations research. Other applications include: - Crew scheduling for airlines (e.g. how to satisfy union rules/minimize time-on-ground/get people
98.
▲
by
idunning
12y ago
While it is a nice tool, RStudio is AGPL, which means it can't be used in many companies due to contamination fears, including Google but I understand many other companies as well.
99.
▲
by
idunning
12y ago
Tried with /JuliaLang/julia and got garbage results - my guess is that the build instructions in the README dominate. Trying something like /JuliaOpt/Optim.jl, which has a very on-topic README, faired slightly better but
100.
▲
by
idunning
12y ago
I think you should invest some time into checking out "good kid, m.A.A.d city" then, really fantastic album.
101.
▲
by
idunning
12y ago
The language I used, JuMP [1], is quite similar to AMPL. In fact in [2] we do performance comparisons with it. Check it out if you have a chance. [1] https://github.com/JuliaOpt/JuMP.jl [2] http://arxiv.org&
102.
▲
by
idunning
12y ago
I suppose it could, and would be fairly easy to do!
103.
▲
by
idunning
12y ago
Could be a challenge: write an IPLANG program with multiple "interesting" solutions
104.
▲
by
idunning
12y ago
It might be possible. Consider adding new auxiliary variables that represent the state of memory after each operation. You may be then able to add (linear) constraints to those auxiliary variables that are meaningful. Including user input c
105.
▲
by
idunning
12y ago
Mostly an exercise in using a tool for something not intended - art? You can definitely express any Brainfuck program as a integer program, and you can add constraints that will constrain what the program does/must do, but it isn'
106.
▲
IPLANG – an optimization-based language
(iaindunning.com)
36 points
by
idunning
12y ago
|
10 comments
107.
▲
by
idunning
12y ago
Not completely. Not an expert on this, but I believe issue at least partially stems from the interaction with the older LLVM JIT we are using. We are moving to the newer LLVM JIT in the 0.4 release cycle and I understand this will address t
108.
▲
by
idunning
12y ago
There is this, which is similar but not quite the same: julia> "hello" |> reverse |> uppercase "OLLEH"
109.
▲
by
idunning
12y ago
I used Julia's in-built profiler to look at your code. Almost all the work is done, as you'd hope, on lines 20, 22, 33, and 35. I added @inbounds to lines 20 and 35, figuring that line 22 is mostly just the effort of calculating t
110.
▲
by
idunning
12y ago
Great stuff. I think the author may be using the release version 0.2, as the boot time issue has been rectified now for the most part in the next release, 0.3. The next big slow-load issues is packages, that'll be post 0.3 though.
111.
▲
by
idunning
12y ago
They are indeed, Julia has replaced the combination of Python (prototyping) and C++ (implementation) for me for scientific work - would be painful to go back.
112.
▲
by
idunning
12y ago
Can anyone describe the improvements to Beamer support?
113.
▲
Naval Warfare with JuMP + Julia
(iaindunning.com)
3 points
by
idunning
13y ago
|
0 comments
114.
▲
by
idunning
13y ago
That visualwebsiteoptimzer page is mathematically confused and the simulation is fatally flawed, I wish it'd disappear from the internet. Check the comments.
115.
▲
by
idunning
13y ago
Exactly - the C interop is used almost exclusively for connecting to existing libraries.
116.
▲
by
idunning
13y ago
Very cool. We had a similar experience when implementing the Simplex method for linear optimization, except we evaluated PyPy versus Julia instead of Cython. Its similar in that it benchmarks "just" the language, not BLAS, which i
117.
▲
by
idunning
13y ago
Is there/what is the best FOSS alternative to this? Something built on D3, perhaps?
118.
▲
Fun with Unicode and Julia
(iaindunning.com)
12 points
by
idunning
13y ago
|
0 comments
119.
▲
by
idunning
13y ago
I don't believe that is correct, re: UCB1 There are probably a few ways to prove the result now, but one (nicely general) way to prove that online learning result would be the method of multiplicative weights: https://www.cs
120.
▲
by
idunning
13y ago
This is a big issue for some people in my lab too. There are interesting efforts towards this, check out Julietta: https://github.com/tknopp/Julietta.jl
More ›