Search Results

Search found 10543 results on 422 pages for 'big bang theory'.

Page 30/422 | < Previous Page | 26 27 28 29 30 31 32 33 34 35 36 37  | Next Page >

• How are hash functions like MD5 unique?

  - by Aly

  Im aware that MD5 has had some collisions but this is more of a high level question about hashing functions. If MD5 hashes any arbitrary string into a 32-digit hex value, then according to the Pigeonhole Principle surely this can not be unique as there are more unique arbitrary strings than there are unique 32-digit hex values

  Read the article

• Strategy and AI for the game 'Proximity'

  - by smci

  'Proximity' is a strategy game of territorial domination similar to Othello, Go and Risk. Two players, uses a 10x12 hex grid. Game invented by Brian Cable in 2007. Seems to be a worthy game for discussing a) optimal strategy then b) how to build an AI Strategies are going to be probabilistic or heuristic-based, due to the randomness factor, and…

  Read the article

• identation control while developing a small python like language

  - by sap

  Hello, Im developing a small python like language using flex, byacc (for lexical and parsing) and C++, but i have a few questions regarding scope control. just as python it uses white spaces (or tabs) for identation, not only that but i want to implement index breaking like for instance if you type "break 2" inside a while loop thats inside…

  Read the article

• cleaning up noise in an edge detection algoritum

  - by Faken

  I recently wrote an extremely basic edge detection algorithm that works on an array of chars. The program was meant to detect the edges of blobs of a single particular value on the array and worked by simply looking left, right, up and down on the array element and checking if one of those values is not the same as the value it was currently…

  Read the article

• What is an NP-complete problem?

  - by Claudiu

  What is an NP-complete problem? Why is it such an important topic in computer science?

  Read the article

• C or C++ to write a compiler?

  - by H.Josef

  I want to write a compiler for a custom markup language, I want to get optimum performance and I also want to have a good scalable design. Multi-paradigm programming language (C++) is more suitable to implement modern design patterns, but I think that will degrade performance a little bit (think of RTTI for example) which more or less might…

  Read the article

• How to spread changes in oriented graph?

  - by joseph

  Hello. I have oriented graph. Graph can be strongly connected. Every vertix can have a set of anything, for example letters. The set is user editable. Every vertix makes intersection of sets in previous vertices (only one step back). But now, there is problem: When I update set of one vertex, the change should expand to all vertices and…

  Read the article

• Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)?

  - by womp

  My co-workers took me back in time to my University days with a discussion of sorting algorithms this morning. We reminisced about our favorites like StupidSort, and one of us was sure we had seen a sort algorithm that was O(n!). That got me started looking around for the "worst" sorting algorithms I could find. We postulated that a…

  Read the article

• IR tree representation of binary operation

  - by drozzy

  I have a simple operation like so: k + 1 What would be a IR tree representation of it? So far I came up with: BINOP(+, MEM(NAME(k)), CONST(1)) but I am not sure if I need the MEM for NAME or not. Any help welcome.

  Read the article

• How do you solve the 15-puzzle with A-Star or Dijkstra's Algorithm?

  - by Sean

  I've read in one of my AI books that popular algorithms (A-Star, Dijkstra) for path-finding in simulation or games is also used to solve the well-known "15-puzzle". Can anyone give me some pointers on how I would reduce the 15-puzzle to a graph of nodes and edges so that I could apply one of these algorithms? If I were to treat each…

  Read the article

• P6 Architecture - Register renaming aside, does the limited user registers result in more ops spent

  - by mrjoltcola

  I'm studying JIT design with regard to dynamic languages VM implementation. I haven't done much Assembly since the 8086/8088 days, just a little here or there, so be nice if I'm out of sorts. As I understand it, the x86 (IA-32) architecture still has the same basic limited register set today that it always did, but the internal…

  Read the article

• A question about logic and Curry-Howard correspondence.

  - by Bubba88

  Hi. Could you please explain me what is the basic connection between the fundamentals of logical programming and the phenomenum of syntatic similarity between type systems and conventional logic?

  Read the article

• Find optimal strategy and AI for the game 'Proximity'?

  - by smci

  'Proximity' is a strategy game of territorial domination similar to Othello, Go and Risk. Two players, uses a 10x12 hex grid. Game invented by Brian Cable in 2007. Seems to be a worthy game for discussing a) optimal algorithm then b) how to build an AI. Strategies are going to be probabilistic or heuristic-based, due to the…

  Read the article

• computing "node closure" of graph with removal

  - by Fakrudeen

  Given a directed graph, the goal is to combine the node with the nodes it is pointing to and come up with minimum number of these [lets give the name] super nodes. The catch is once you combine the nodes you can't use those nodes again. [first node as well as all the combined nodes - that is all the members of one super…

  Read the article

• Linear complexity and quadratic complexity

  - by jasonline

  I'm just not sure... If you have a code that can be executed in either of the following complexities: A sequence of O(n), like for example: two O(n) in sequence O(n²) The preferred version would be the one that can be executed in linear time. Would there be a time such that the sequence of O(n) would be too much and…

  Read the article

• Write a compiler for a language that looks ahead and multiple files?

  - by acidzombie24

  In my language I can use a class variable in my method when the definition appears below the method. It can also call methods below my method and etc. There are no 'headers'. Take this C# example. class A { public void callMethods() { print(); B b; b.notYetSeen(); public void print() { Console.Write("v = {0}",…

  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 any vertex…

  Read the article

• A Turing Machine Question

  - by Hellnar

  Greetings, I have been struggling to find a question regarding this theoretical question, even tho it is not directly a programming question, I believe it is really related. Assume a type of Turing machine which cannot have more than 1000 squares. What would be the relationship between the set of such type of…

  Read the article

• I need an algorithm to get the chromatic number of a graph.

  - by Carlos Sanchez

  Given the adjacency matrix of a graph, I need to obtain the chromatic number (minimum number of colours needed to paint every node of a graph so that adjacent nodes get different colours). Preferably it should be a java algorithm, and I don't care about performance. Thanks.

  Read the article

• How does a compiler initially compile itself?

  - by jdk

  I recently read the Mono C# compiler is able to compile itself. Cool. In the past I've heard of other languages doing the same. It twists my mind - seems like a chicken and egg problem. What comes first, second and third, etc?...

  Read the article

• What is the exact problem with multiple inheritance?

  - by Totophil

  I can see people asking all the time whether multiple inheritance should be included into the next version of C# or Java and C++ folks, who are fortunate enough to have this ability, say that this is like giving someone a rope to eventually hang themselves. What’s the matter with the multiple inheritance? Are…

  Read the article

• Amazing families of algorithms over implicit graphs

  - by Diego de Estrada

  Dynamic programming is, almost by definition, to find a shortest/longest path on an implicit dag. Every DP algorithm just does this. An Holographic algorithm can be loosely described as something that counts perfect matchings in implicit planar graphs. So, my question is: are there any other families of…

  Read the article

• What is the actual datastructue used in implementation of collection and their order?

  - by Abhishek Jain

  There are different collections are used in Java like hashtable, hashset, vector, treeset, treemap and hashmap. How are they implemented internally? What are the actual datastructure used for these collection? And, What is order? Thanks, -Abhishek

  Read the article

• recurrence solution, too loose a bound?

  - by Tony

  I have the following worked out: T(n) = T(n - 1) + n = O(n^2) Now when I work this out I find that the bound is very loose. Have I done something wrong or is it just that way?

  Read the article

• integer division properties

  - by aaa

  hi. does the following integer arithmetic property hold? (m/n)/l == m/(n*l) At first I thought I knew answer (does not hold), but now am not sure. Does it hold for all numbers or only for certain conditions, i.e. n > l?

  Read the article

< Previous Page | 26 27 28 29 30 31 32 33 34 35 36 37  | Next Page >