Interesting Ideas
From Daniel Crabtree
Idea's which are interesting, but not interesting enough to be kept secret.
Newest Ideas
Using Metric Condition For Dimensional Inference
Yun made an interesting observation (on Sunday, 6th November 2005) about the condition that makes a metric a metric rather than a pseudometric with regards to dimensionality.
Multi Bit Set Intersection = O(n) intersection of multisets
Other methods are also discussed, including Yun's Prime Number Decomposition method, something I extracted from her Pres algorithm for simplifying functions.
Model Optimizing Selection Algorithm
The maximal covering algorithm which generalizes to the model based cluster selection algorithm can generalize further to being an algorithm for picking a set solution from a set of sets of solutions where there is a heuristic for picking individual elements of the solution which has the substructure property and which can be summed to give the solution heuristic. It works best when you can compute enough lookahead to avoid local optima, ie. when the groups that act suboptimally can be enclosed totally within the lookahead depth.
