Wednesday, August 11, 2010

Chess Competition Problem?

To one of my friends one of Google's engineers presented his data at Berkeley which I saw through a telacast at Merced comparing optimized with unoptimized algorithms sorting a dataset for accuracy. What he found was that as the size of the dataset increased (and assuming related increases in machine power) was that the unoptimized algorithms outperformed and better handled different test cases (such as different languages) much more easily. In fact the optimized algorithm accuracy rose at a linear rate while the unoptimized algorithm increased at an exponential rate.

So I wonder if that's a problem with the chess competition, the dataset might be too small to future proof the algorithm. Hmm....

Ciao

Update:
Here is the link.
http://www.citris-uc.org/events/RE-fall2009

Thursday, August 5, 2010

Fixed the Android Problem

Fixed the seg fault with android.

findViewById returns a null if you cast an object that the casting was not compatible with.


Such as a checkbox


ch = (CheckBox) findViewById(R.id.check);
So for whatever object you seek to fetch you must declare it like such in the XML file.


android:layout_width="fill_parent"
android:layout_height="fill_parent"
android:text="This checkbox is: unchecked" />


NOT 


android:layout_width="fill_parent"
android:layout_height="fill_parent"
android:text="This checkbox is: unchecked" />

As you might leave in due to the automade boilerplate code.



It's an easy mistake to make....

Ciao