|
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?
Started by martinus on
, 8 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
The basic idea.
problem I came up while tinkering with color quantization and image compression.
|
|
One of the greatest joys (and hardest things to convey to non-programmers) is the feeling of exhilaration we often get when we finally get that "aha!" moment working on a tough problem - then we go implement it and it works magically. I've been thinking...
Started by Christopher Lang on
, 21 posts
by 21 people.
Answer Snippets (Read the full thread at stackoverflow):
There were no textbook solutions for this problem!
Talk about A = B
LET B = C
LET C =....
Not the most challenging problem I've ever solved, but for my age be depending on the accuracy of the results.
PIL)
EDIT : Here is a sample.
|
|
I am interested in finding if producer-consumer problem when there are multiple produce and multiple consumer be solved without using assignment i.e., using functional style of programming? How?
Producer-consumer problem
Thanks
Started by StackUnderflow on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
But this just moves the problem from your code into the OS: At a certain point, you in the end, it's not really....
As the producer-consumer problem, and as such I don't think you'll be able to solve it in a functional way executing them.
|
Ask your Facebook Friends
|
The halting problem cannot be solved for turing complete languages and it can be solved trivially for some non TC languages like regexes where it always halts.
I was wondering if there are any languages where it has both the ability to halt and not halt...
Started by Shalmanese on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
Perhaps you meant to ask whether it can be solved.
Rather, it acts on machines (i.e., programs): it asks whether a given program halts on a given input .
The halting problem does not act on languages.
|
|
1. problem solved
2. problem
i get this
http://img641.imageshack.us/img641/2999/zajetaslika.jpg
Started by ~|IEG|~#BoSnA# on
, 15 posts
by 4 people.
Answer Snippets (Read the full thread at mtavc):
META.XML
Line number On/Off | Expand/Contract | Select all LUA all again last problem
http://img8....
Show us meta.xml (If you don't have it, create it) Show us code CORE_CLIENT PROBLEM GetLocalPlayer for scripters to see the problem.
|
|
I was reading about DI thoroughly, and it seems interesting. So far, I'm totally living without it.
All the examples i saw are related to JNDI and how DI helps you being more flexible.
What is real life applications/problems that you solved with DI that...
Started by medopal on
, 9 posts
by 9 people.
Answer Snippets (Read the full thread at stackoverflow):
I'd call that a real world problem which I solved by dependency injection suited to one particular type of problem, rather it's a different way of solving a problem of time and LOCs, but I still....
Up his daughters phone.
|
|
I'd like to know about specific problems you - the SO reader - have solved using constraint programming and what constraint logic language you used.
Questions:
What problems have you used constraint programming to solve? What constraint logic language...
Started by knorv on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
The problems has been very.
I'm not sure constraint programming and the systems than to solve a specific problem.
Benchmarking this I solved problems such as N-Queens and Golomb Rulers.
|
|
I saw this question , but the answers there are not very relevant. A friend needs a bank of solved recursion problems to help him study for a test tomorrow .
He learned the issue theoretically, but is having problems grasping how to actually solve recursion...
Started by ripper234 on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
Equivalently, you 1 single instance of what....
1) how to solve the smallest instance of the problem, and 2) how to break it up into smaller parts.
You just need to know 2 things.
You don't need to know how to solve the problem.
|
|
I'd like to know about specific problems you - the SO reader - have solved using artificial neural network techniques and what libraries/frameworks you used if you didn't roll your own.
Questions:
What problems have you used artificial neural networks...
Started by knorv on
, 17 posts
by 17 people.
Answer Snippets (Read the full thread at stackoverflow):
This is a very hard....
My PhD a gamma ray telescope.
This is a problem that has many independent variables and extremely nonlinear my own solution and revisiting the problem because I need more control over the data.
Deformation capacity.
|
|
Recently I read a seminar work which says:
The matching algorithm [for general graphs] can be extended to the weighted case, which appears to be one of the "hardest" combinatorial optimization problems that can be solved in polynomial time.
Immediately...
Started by Karussell on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
Another "hard....
There are actually "P-complete" problems, which means that every other problem-complete .
Linear_programming#Algorithms
The Assignment Problem which can be solved in O(n 3 ) by the modifiedPrimes is in P .
|
