Omgili - forum search, search forums  
  

Discussions about problem solved

Displaying 1 - 10 out of 358,420 discussions.  
Time Frame: (Any time)   Minimum number of replies: (2)   Minimum number of discussing users: (0)
  |  

Page: 1   2   3   4   5   6   7   8   9   10  
Keep this page open to be updated with the newest discussions automatically.
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 on , 8 posts by 8 people.  
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 on , 21 posts by 21 people.  
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 on , 6 posts by 6 people.  
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 on , 4 posts by 4 people.  
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.
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 on , 9 posts by 9 people.  
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 on , 4 posts by 4 people.  
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 on , 6 posts by 6 people.  
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 on , 17 posts by 17 people.  
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 on , 6 posts by 6 people.  
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 .
By Logic Programming I mean the a sub-paradigm of declarative programming languages. Don't confuse this question with "What problems can you solve with if-then-else?" A language like Prolog is very fascinating, and it's worth learning for the sake of ...
Started by on , 6 posts by 6 people.  
You think you've found a problem with the foobar/2.
Implement it yourself, but if your problem is best solved by having that algorithm available you're currently running on the fly with edit(1) .
Page: 1   2   3   4   5   6   7   8   9   10  
Related Searches
solving problem optiplex 320    how to solve the problem of access denied    solving a problem in cplex complexity    solving linear least-squares problem code    how to solve the IP address problem on the XBOX 360    explore sending error problem solve    c problems to solve for beginners    modi's method to solve degenrate problem    a problem has encountered solve    how to solve attitude problems   
More Information


Forum Search About Omgili Help Plugins Forum/Board Owners Privacy

i
In Title
In Topic
In Reply
Exclude
Boost