Search Results

Search found 97 results on 4 pages for 'dolf dijkstra'.

Page 3/4 | < Previous Page | 1 2 3 4  | Next Page >

• Low CPU/Memory/Memory-bandwith Pathfinding (maybe like in Warcraft 1)

  - by Valmond

  Dijkstra and A* are all nice and popular but what kind of algorithm was used in Warcraft 1 for pathfinding? I remember that the enemy could get trapped in bowl-like caverns which means there were (most probably) no full-path calculations from "start to end". If I recall correctly, the algorithm could be something like this: A) Move towards enemy…

  Read the article

• Initialize array in amortized constant time -- what is this trick called?

  - by user946850

  There is this data structure that trades performance of array access against the need to iterate over it when clearing it. You keep a generation counter with each entry, and also a global generation counter. The "clear" operation increases the generation counter. On each access, you compare local vs. global generation counters; if they differ, the…

  Read the article

• How often do CPUs make calculation errors?

  - by veryfoolish

  In Dijkstra's Notes on Structured Programming he talks a lot about the provability of computer programs as abstract entities. As a corollary, he remarks how testing isn't enough. E.g., he points out the fact that it would be impossible to test a multiplication function f(x,y) = x*y for any large values of x and y across the entire ranges of x and…

  Read the article

• Interviews that include Algorithms and Data Structures

  - by EricFromSouthPark

  I want to start looking for jobs in great companies and I have four years of enterprise corporations development, three years with C#.NET and alomst one year with Ruby On Rails, JS, etc... But when I look up interview questions from Google, Amazon, Fog Creek, DropBox, etc... they are really targeted at students that are coming fresh out of…

  Read the article

• Initialize array in O(1) -- how is this trick called?

  - by user946850

  There is this pattern that trades performance of array access against the need to iterate it when clearing it. You keep a generation counter with each entry, and also a global generation counter. The "clear" operation increases the generation counter. On each access, you compare local vs. global generation counters; if they differ, the…

  Read the article

• Papers on Software Methodology recommendation

  - by kunjaan

  Please recommend me software engineering/methodology/practices paper. So far I have enjoyed: 1968 Dijkstra : Go To Statement Considered Harmful Reason about correctness about program Nikalus Wirth : Program Development by Stepwise Refinement Not worried about program structure 1971 David Parnas : Information Distribution Aspects of…

  Read the article

• Software Engineering Papers

  - by kunjaan

  Please recommend me software engineering/methodology/practices paper. So far I have enjoyed: 1968 Dijkstra : Go To Statement Considered Harmful Nikalus Wirth : Program Development by Stepwise Refinement 1971 David Parnas : Information Distribution Aspects of Design Methodology 1972 Liskov : Design Methodology for Reliable Software…

  Read the article

• graph library for scala

  - by Elazar Leibovich

  Is there a good library (or wrapper to Java library) for graphs, and/or graph algorithms in scala? This one seems to be quite dead. This is an example for the Dijkstra algorithm in scala, but I'm looking for a library a-la JGraphT.

  Read the article

• I am trying to build a list of limitations of all graph algorithms

  - by Jack

  Single Source shortest Path Dijkstra's - directed and undirected - works only for positive edge weights - cycles ?? Bellman Ford - directed - no cycles should exist All source shortest path Floyd Warshall - no info Minimum Spanning Tree ( no info about edge weights or nature of graph or cycles) Kruskal's Prim's -…

  Read the article

• Influential female programmers/computer scientists (apart from Ada Lovelace!)

  - by Helper Method

  Everyone knows the names Dijkstra, Kernighan, Richie, Bloch and so on but are there actually (well-known) female programmers/computer scientists who made a great impact, developed some fundamental ideas, etc.? Shame on me, I don't know any (and probably some of you neither)...

  Read the article

• What should 'Computer Science' be called?

  - by Dylan White

  A famous computer scientist, Edsger Dijkstra, once remarked, "Computer Science is no more about computers than astronomy is about telescopes." I am inclined to agree. However, this brings up an interesting question: what would a better name for the field be?

  Read the article

• How do I implement graphs and graph algorithms in a functional programming language?

  - by brad

  Basically, I know how to create graph data structures and use Dijkstra's algorithm in programming languages where side effects are allowed. Typically, graph algorithms use a structure to mark certain nodes as 'visited', but this has side effects, which I'm trying to avoid. I can think of one way to implement this in a…

  Read the article

• All possible paths in a cyclic undirected graph

  - by Elias

  I'm trying to develop an algorithm that identifies all possible paths between two nodes in a graph, as in this example. in fact, i just need to know which nodes appear in all existing paths. in the web only got references about DFS, A* or dijkstra, but i think they doesn't work in this case. Does anyone know how to solve…

  Read the article

• Java: Object Array assignment in for loop

  - by Hackster

  I am trying to use Dijkstra's algorithm to find the shortest path from a specific vertex (v0) to the rest of them. That is solved and works well with this code from this link below: http://en.literateprograms.org/index.php?title=Special:DownloadCode/Dijkstra%27s_algorithm_(Java)&oldid=15444 I am having trouble with…

  Read the article

• My Big Break - this is my story and I am sticking to it ;)

  - by dbasnett

  The value of undertaking new and difficult tasks can have many wonderful consequences, don't you agree? Here is the story of my big break. Remember yours? During the mid 70's I was in the Navy and worked as a computer operator at the CNO's Command and Control computer system (WWMCCS) in the Washington Navy Yard. I…

  Read the article

• SFML - Moving a sprite on mouseclick

  - by Mike

  I want to be able to move a sprite from a current location to another based upon where the user clicks in the window. This is the code that I have: #include <SFML/Graphics.hpp> int main() { // Create the main window sf::RenderWindow App(sf::VideoMode(800, 600), "SFML window"); // Load a sprite to…

  Read the article

• How to proceed on the waypoint path?

  - by Alpha Carinae

  I'm using Dijkstra algorithm to find shortest path and I'm drawing this path on the screen. As the character object moves on, path updates itself(shortens as the object approaches the target and gets longer as the object moves away from it.) I tried to visualize my problem. This is the beginning state. 'A' node is…

  Read the article

• ArchBeat Link-o-Rama for 2012-09-28

  - by Bob Rhubart

  Follow the action: OTN's YouTube Channel Check out what's happening at Oracle OpenWorld and JavaOne with video coverage by the OTN crew. New interviews and more posted daily on the OTN YouTube channel. Whiteboards, not red carpets. OTN Architect Day Los Angeles. Oct 25. Free event. Yes, it's Tinsel Town, but…

  Read the article

• ArchBeat Link-o-Rama for 2012-09-26

  - by Bob Rhubart

  Oracle Introduces Free Version of Oracle Application Development Framework Several community bloggers have already written about Oracle Application Development Framework (ADF) Essentials, the free version of Oracle ADF. Here's the official press release. ADF Essentials - Quick Technical Review | Andrejus…

  Read the article

• Prevent collisions between mobs/npcs/units piloted by computer AI : How to avoid mobile obstacles?

  - by Arthur Wulf White

  Lets says we have character a starting at point A and character b starting at point B. character a is headed to point B and character b is headed to point A. There are several simple ways to find the path(I will be using Dijkstra). The question is, how do I take preventative action in the code to stop the two…

  Read the article

• CodePlex Daily Summary for Thursday, November 25, 2010

  CodePlex Daily Summary for Thursday, November 25, 2010Popular ReleasesSQL Monitor: SQL Monitor 1.4: 1.added automatically load sql server instances 2.added friendly wait cursor 3.fixed problem with 4.0 fx 4.added exception handlingDeep Zoom for WPF: First Release: This first release of the Deep Zoom control…

  Read the article

• Algorithm shortest path between all points

  - by Jeroen

  Hi, suppose I have 10 points. I know the distance between each point. I need to find the shortest possible route passing trough all points. I have tried a couple of algorithms (Dijkstra, Floyd Warshall,...) and the all give me the shortest path between start and end, but they don't make a route with all…

  Read the article

• What is the relaxation condition in graph theory

  - by windopal

  Hi, I'm trying to understand the main concepts of graph theory and the algorithms within it. Most algorithms seem to contain a "Relaxation Condition" I'm unsure about what this is. Could some one explain it to me please. An example of this is dijkstras algorithm, here is the pseudo-code. 1 function…

  Read the article

• Graph Algorithm To Find All Paths Between N Arbitrary Vertices

  - by russtbarnacle

  I have an graph with the following attributes: Undirected Not weighted Each vertex has a minimum of 2 and maximum of 6 edges connected to it. Vertex count will be < 100 I'm looking for paths between a random subset of the vertices (at least 2). The paths should simple paths that only go through…

  Read the article

• Need some clarification on Bankers Algorithm

  - by Moonshield

  Hi, just a quick query about safe/unsafe states in Dijkstra's Banker's algorithm... If one of the processes in the snapshot of the system (for example the one below) already has all of its needs fulfilled and there are not sufficient resources available to fulfil the needs of any of the other…

  Read the article

< Previous Page | 1 2 3 4  | Next Page >