Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re(tilly) 3: (Golf) Fragment Reassembly

by tilly (Archbishop)
on May 03, 2001 at 06:14 UTC ( #77553=note: print w/ replies, xml ) Need Help??


in reply to Re: Re (tilly) 1: (Golf) Fragment Reassembly
in thread (Golf) Fragment Reassembly

Oops, my misreading.

As for the question, there actually are well-explored areas where the best known algorithms (by various criteria) are found by randomly guessing something with certain characteristics and then testing whether it really was a solution...


Comment on Re(tilly) 3: (Golf) Fragment Reassembly

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://77553]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (10)
As of 2015-07-29 02:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (260 votes), past polls