9,473 reputation
11840
bio website en.wikipedia.org/wiki/…
location United States
age 70
visits member for 3 years, 9 months
seen 8 hours ago

BS Mechanical Engr.
PhD CS(AI)
CS Prof (4yr)
Numerous consulting jobs.
15 yr at http://www.pharsight.com
Published book on CS & several articles
4 kids, 2 grand
Pilot(student)

P.S. The picture is a Beta-prime distribution. It shows the program speedup factors you can get if you see a problem twice in 2, 3, 4, and 5 samples.


Jun
18
comment Is there a comparative study of the memory consumption of programming languages runtimes, correlated with expressiveness and production bug ratios?
@haylem: I bow to an honest question. Good luck.
Jun
18
comment Is there a comparative study of the memory consumption of programming languages runtimes, correlated with expressiveness and production bug ratios?
@haylem: well, I did enough of it myself, and as for interesting angles, I gave it my best shot. As a practitioner, I find what young programmers have been taught about performance is amazingly naive.
Jun
18
comment Is there a comparative study of the memory consumption of programming languages runtimes, correlated with expressiveness and production bug ratios?
"Is there a comparative study ..." etc. I've seen this kind of question before, and to my mind it reflects a common misperception - that as long as you choose the right language, you'll be making an optimal tradeoff between expressibility and performance. IME, any program that makes heavy use of memory allocation and deallocation is going to suffer badly, and that could be due to the language, and/or the way the program is written.
May
28
revised Jargon to describe unnecessary running of code?
deleted 32 characters in body
May
27
revised Jargon to describe unnecessary running of code?
added 83 characters in body
May
27
answered Jargon to describe unnecessary running of code?
May
5
revised Divide and Conquer algorithms – Why not split in more parts than two?
deleted 1 characters in body
May
5
answered Divide and Conquer algorithms – Why not split in more parts than two?
May
3
answered How can you prove an acyclic graph has n-1 edges?
Apr
29
answered How did they debug segmentation faults before protected memory?
Apr
25
answered Why do we need “callback functions”?
Apr
23
revised Approach to simplifying an algorithm
added 1739 characters in body
Apr
23
revised Approach to simplifying an algorithm
added 138 characters in body
Apr
23
comment Why do we need “callback functions”?
+ That's what callbacks are good for, but I hate having to write them :-)
Apr
23
answered Approach to simplifying an algorithm
Apr
22
revised How to calculate percentile in Java without using Library
added 344 characters in body
Apr
22
revised How to calculate percentile in Java without using Library
added 344 characters in body
Apr
22
answered How to calculate percentile in Java without using Library
Apr
16
awarded  Good Answer
Apr
16
comment Implicit optimization versus explicit optimization
+ Library routines should not be sluggards, but their main purpose is ease of use, correctness, and reliability. I discovered using LAPACK that it was actually not very efficient in the case of small matrices, but it still serves its purpose.