Recent content by haki

Here here. Ubuntu is great. Like mentioned packet manager/repository. Doesn't come with the kitchen sink but just what you need (the rest can be easily installed). Also IMHO great hardware support. Painless to get external devices up and running (I do not share the same experience with Fedora 9...

Aside. If you are using SWI Prolog, I recommend to use the debugger for tracing the execution - it is not great but it helps.

Are you familiar with the syntax of the lists? namely [H|T]? Notice that you can use [H|T] for your 'return' variable not just for 'incoming' variable this is what I mean: e.g. sum([1,2,3,4,5],Sum,ReverseSteps). Sum = 15 ReverseSteps = [15, 14, 12, 9, 5]] you are familiar with this...

This is 'Hello World' level for lists in Prolog. For starters create a 'function' that sums a list. sum([1,2,3],X). X = 6. You should get the idea. Do you self study Prolog?

The salesman should not visit any node more than once. In the 5 point star graph, if I'd put it in my problem solver let's say the solver is PS(G,N) where PS is the solver, G is the graph(not-connected, undirected, weighted) and N is the number of stations to visit. for...

What if my arbitrary graph is 6 train stations where the geometric layout is like the 5 stations are at the edges of a 5 pointed star with 6th station being in the center as the hub, and the 5 stations are only connected to the hub station i.e. G({a,b,c,d,e,h},{a-h,b-h,c-h,d-h,e-h}). There...

There is just a slight problem, if I am not mistaken the TSP requires that the graph is complete. But my graph is not complete - it is more like railway diagram, where the vertices are train stations and edges are the rails, it is connected but not complete and I want to visit N train...

silly me, will look into TSP algorithms, just need to modify not to go trough all the points but just N points. Since the graph can have M points but I am interested in visiting only N points and not all. For starters something along the lines of a simple BFS with heuristic to always select...

I've got a small assignment to do on graphs but it's a bit frustrating that no standard algoritms such as Dijkstra, Bellman-Ford, etc. can be used or at least I don't know how could they help. Given a graph one is to find shortest path through N points. That's it. Starting point can be...

Thanks, looks promising specially the link found on the site to http://lernen.bildung.hessen.de/informatik/swiprolog/indexe.htm this is something I was looking for.

I wish to do some Prolog programming, How to set up the environment? Which implementation, IDE is easy on the beginner? Ofcorse it has to be free at least for personal use. Any hints would be very welcome. I googled Prolog and all what I could find was some Win 3.1 looking programs, surely...

Why focus only on the CPU? There are other parts of the Computer that are getting faster day by day, such as Memory and I/O systems, not to mention the Video Cards (stronger GPU, more RAM). As for CPUs goes I think we will see more and more of multi-core CPUs. Btw: How fast is fast enough? I...

Yeah, you can't go wrong with a ThinkPad. If money is not a problem get the T series (T61 or T60) other-wize Z and R series are nice aswell.

Why does Python have such a poor performance on the language shoot out page? http://shootout.alioth.debian.org/gp4/benchmark.php?test=all&lang=java&lang2=python I tought that the power of Java lies in the VM (it does dynamic optimization rather than compile time static optimization).

Just one quick question: What do you think about the reduce() in python? Should it really be removed?