artificial-intelligence

I'm looking for an Ada constructed framework for AI. I think Ada would be perfect for implementing temporal and stochastic paradigms due to its tasking and real-time mechanisms, but did not find anyone who tried to make such a libraries. Actually I did not find strong implementations on other languages too. For C# I found http://www.c-sharpcorner.com/1/56/ , and for C++ I found http://mind.sourceforge.net/cpp.html but both did not get much popularity. Maybe java has good AI libraries too, but I do not know. So, do you know an Ada implementation? Would it be useful for more anyone? If you know

Okay, let me preface this by saying that I am well aware that this depends on MANY factors, I'm looking for some general guidelines from people with experience. My goal is not to make a Neural Net that can compute squares of numbers for me, but I thought it would be a good experiment to see if I implemented the Backpropagation algorithm correctly. Does this seem like a good idea? Anyways, I am worried that I have not implemented the learning algorithm (fully) correctly. My Testing (Results): Training Data : 500 randomly generated numbers between .001 and .999 using Java's Random Network

I want to create a recommendation engine for my website. Suppose a user comes to my website. I want to recommend him what other products he can view. I can create a recommendation engine. But, how to find patterns? What I have thought is, if by any means I can know which products were browsed by an user, I can find a pattern in that and suggest to another user. But, is this information tracking possible without making the user login? Tracking IP address may be one way, but IP may be dynamic. I have heard about cookies. Please help me. Are there any APIs for this? Davide Aversa Setting cookies

I am trying to load .clp file in my iPhone application. For that I am using below code NSString *filePath = [[NSBundle mainBundle] pathForResource:@"autodemo" ofType:@"clp"]; environment = CreateEnvironment(); char *clipsFileChar = (char *)[filePath cStringUsingEncoding:NSASCIIStringEncoding]; Load(clipsFileChar); Reset(); Run(-1); NSString *evalS = [NSString stringWithFormat:@"(find-all-facts ((?f state-list)) TRUE)"]; char * evalStr = (char *)evalS; DATA_OBJECT obj;// = {0,-1}; // obj.type = STRING; // obj.value = evalStr; int i = Eval(evalStr, &obj); NSLog(@"%d",i); now when I run this code

If on a 2d plane there are a no. of obstacles of all possible 2d shapes(circles, quadrilaterals, triangles, irregular shapes...) then how do you implement a mechanism to find the shortest path around the obstacles? I'm considering visual c++, as it provides many graphical classes to draw such figures. I have come quite far 1) Firstly i'll be using A* search(A-star) to find the path with least cost 2) The path with the least displacement from the straight path will be considered for best path. (not really sure though) 3) The shortest path to get around a figure, for eg from the start, is a line

I've read (for example, http://radagast.se/othello/Help/order.html ) that searching on the best moves at each level first (which can be found using iterative deepening) makes the search go much faster. How would one go about searching on the best moves possible without using too much additional memory and cpu time? There are basically two strategies: Static move ordering Dynamic move ordering Dynamic move ordering uses information from previous searches, either because you transpose into the same position again, or you have already reached the position in a previous less thorough search. That