Article View: comp.lang.misc
Article #961Re: A note for those not consumed by ef
From: robison
Date: Fri, 23 Mar 1990 01:30
Date: Fri, 23 Mar 1990 01:30
19 lines
1140 bytes
1140 bytes
Last year I had the following experience with a group-theory computation:
Monday: Start algorithm A running.
Tuesday: Discover algorithm B, code it, and start it running.
Saturday: Algorithm B finishes.
Next Monday: Algorithm A finishes.
[The days of the week may actually have been different.]
In this case optimization was clearly worth my time to
obtain the answer more quickly. I let algorithm A finish
as a check on algorithm B. Of course, the improvement from
A to B was more than bit twiddling.
Arch D. Robison
University of Illinois at Urbana-Champaign
UUCP: {pur-ee,convex}!uiucdcs!robison
Internet: robison@CS.UIUC.EDU
Technical Details
Message-ID:
<5200054@m.cs.uiuc.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!uunet!dino!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!m.cs.uiuc.edu!robisonReferences:
<190858@<1990Mar17>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!uunet!dino!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!m.cs.uiuc.edu!robison From: robison@m.cs.uiuc.edu Newsgroups: comp.lang.misc Subject: Re: A note for those not consumed by ef Message-ID: <5200054@m.cs.uiuc.edu> Date: 23 Mar 90 01:30:43 GMT References: <190858@<1990Mar17> Lines: 19 Nf-ID: #R:<1990Mar17:190858:m.cs.uiuc.edu:5200054:000:651 Nf-From: m.cs.uiuc.edu!robison Mar 22 09:42:00 1990