I love to work on AI optimization software (Genetic Algorithms, Particle Swarm, Ant Colony, ...). Unfortunately I have run out of interesting problems to solve. What problem would you like to have solved?
+9
A:
This list of NP complete problems should keep you busy for a while...
Hans Passant
2008-12-22 14:13:49
+1
A:
I would like my bank balance optimised so that there is as much money as possible left at the end of the month, instead of the other way round.
frankodwyer
2008-12-22 14:20:16
while (expenses > income) expenses--;
Jon B
2008-12-22 14:38:14
i tried that but it throws a BillCantBeIgnored exceptionit also seems that some other threads are repeatedly decrementing my income
frankodwyer
2008-12-22 14:58:18
I've tried Income.Raise() but it always returns null :(
Jon B
2008-12-22 15:00:39
lock ( PayCheck ) { Bills.Pay(); EndOfMonth.Wait(); }
Vilx-
2008-12-22 15:37:34
The opposite? Many months left at the end of the money? ;)
Jonas Kölker
2009-02-01 20:37:06
+4
A:
How about the Hutter Prize?
From the entry on Wikipedia:
The Hutter Prize is a cash prize funded by Marcus Hutter which rewards data compression improvements on a specific 100 MB English text file. [...]
The goal of the Hutter Prize is to encourage research in artificial intelligence (AI). The organizers believe that text compression and AI are equivalent problems.
Basically the idea is that in order to make a compressor which is able to compress data most efficiently, the compressor must be, in Marcus Hutter's words, "smarter". For more information on the relation between artificial intelligence and compression, see the Motivation and FAQ sections of the Hutter Prize website.
coobird
2008-12-22 14:23:44
+2
A:
Here's an interesting practical problem I came up while tinkering with color quantization and image compression.
The basic idea is that I would like a program to which I give a picture and it reduces the amount of colors is it as much as possible without me noticing it. Since every person has a different sensitivity of the eye (and eyes have different sensitivity of red/green/blue intensities), it should be possible to specify this sensitivity threshold in some way.
In other words, in a truecolor picture, replace every pixel's color with another color so that:
- The total count of different colors in a picture would be the smallest possible; and
- Every new pixel would have it's color no further from the original color than some user-specified value D.
The D can be defined in different ways, pick your favorite. For example:
- Separate red, green and blue components for specifying the maximum possible deviation for each of them (for every pixel you get a rectangular cuboid of valid replacement values);
- A real number which would represent the maximum allowable distance in the RGB cube (for every pixel you get a sphere of valid replacement values);
- Something inbetween or completely different.
Vilx-
2008-12-22 14:35:29
Given D = sqrt((r2-r1)^2 + (g2-g1)^2 + (b2-b1)^2), a good approach would be to enumerate all palette colours present, and calculate a 'set of all nearest neighbours' between each palette entry. Where the distance falls inside the thresh-hold, replace both with the average and repeat,
Shane MacLaughlin
2008-12-22 15:15:02
Is that *guaranteed* to return the least amount of colors necessary? And won't this eventually allow (after enough iterations) for a pixel's color to deviate far enough that it falls outside of the theshold (I think it will).
Vilx-
2008-12-22 15:35:27
A:
Most efficient solution to a given set of Sudoku puzzles. (excluding brute-force methods)
dviljoen
2008-12-22 14:37:52
Sudoku can be easily solved with Linear Programming or Constraint Programming, see e.g. http://choco-solver.net/index.php?title=Sudoku_and_constraint_programming
martinus
2008-12-22 15:02:01
See Danny Hillis' co-evolutionary approach to minimal sorting nets. Evolving a sudoku solver against boards that resist solving...
jamesh
2009-01-14 00:48:34