The Artima Developer Community
Sponsored Link

Ruby Buzz Forum
Haskell, Ruby and Infinity

0 replies on 1 page.

Welcome Guest
  Sign In

Go back to the topic listing  Back to Topic List Click to reply to this topic  Reply to this Topic Click to search messages in this forum  Search Forum Click for a threaded view of the topic  Threaded View   
Previous Topic   Next Topic
Flat View: This topic has 0 replies on 1 page
Max Zone

Posts: 9170
Nickname: dzone
Registered: Jun, 2006

dzone.com is a link-sharing community where member participation determines what gets published
Haskell, Ruby and Infinity Posted: Feb 27, 2007 11:50 AM
Reply to this message Reply

This post originated from an RSS feed registered with Ruby Buzz by Max Zone.
Original Post: Haskell, Ruby and Infinity
Feed Title: dzone.com: ruby
Feed URL: http://feeds.dzone.com/dzone/ruby
Feed Description: dzone.com: fresh ruby and rails links for developers
Latest Ruby Buzz Posts
Latest Ruby Buzz Posts by Max Zone
Latest Posts From dzone.com: ruby

Advertisement
The clustering algorithm requires a very large, fixed set of curves.1 I wrote the initial curve generation by building a gigantic list of parameter tuples, and then processing the list into records. Once the ���search space��� grew beyond a trivial size, the program began to eat enormous amounts of memory. The problem was that I was trying to write the generation code as clearly as possible, and that created a massive thicket of objects that all resided in memory simultaneously.

Read: Haskell, Ruby and Infinity

Topic: From the Dark Side of the Moon Previous Topic   Next Topic Topic: PDF::Writer for Ruby

Sponsored Links



Google
  Web Artima.com   

Copyright © 1996-2019 Artima, Inc. All Rights Reserved. - Privacy Policy - Terms of Use