The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
1answer
66 views

How to find the running time of an algorithm that involves heuristics

I am working with A* algorithm, in which I have a 2D grid and given two points, find the shortest distance between them, while not running into any obstruction. Now, for each cell, I find the ...
8
votes
1answer
178 views

heuristic for searching through non-perfectly sorted data

Given sorted data, the search solution is obvious. Given unsorted data, sensible options are sort then search or just linear search. This question is about what to do if the data is somewhat sorted, ...
11
votes
7answers
866 views

Do path-finding algorithms have practical use outside of game development?

I'm interested to know if heuristic-based path-finding algorithms such as A* have any real world practical use outside the realm of game development. Are there any other fields of software ...
6
votes
5answers
325 views

Finding an A* heuristic for a directed graph

In a previous question, I asked about finding a route (or path if you will) in a city. That is all dandy. The solution I chose was with the A* algorithm, which really seems to suit my needs. What I ...
13
votes
8answers
551 views

Should you abandon an ORM framework when you need to implement a bulk operation?

Here's a common situation: You need to implement a bulk operation in an application that uses an ORM framework. After the first pass, you've noticed significant performance problems. Here's my ...