Search Results

Search found 5079 results on 204 pages for 'bankers algorithm'.

Page 39/204 | < Previous Page | 35 36 37 38 39 40 41 42 43 44 45 46  | Next Page >

• Higher-order unification

  - by rwallace

  I'm working on a higher-order theorem prover, of which unification seems to be the most difficult subproblem. If Huet's algorithm is still considered state-of-the-art, does anyone have any links to explanations of it that are written to be understood by a programmer rather than a mathematician? Or even any examples of where it works and the usual first-order algorithm doesn't?

  Read the article

• Sliding window algorithm for activiting recognition MATLAB

  - by csc

  I want to write a sliding window algorithm for use in activity recognition. The training data is <1xN so I'm thinking I just need to take (say window_size=3) the window_size of data and train that. I also later want to use this algorithm on a matrix . I'm new to matlab so i need any advice/directions on how to implement this correctly.

  Read the article

• Is Collections.shuffle suitable for a poker algorithm?

  - by Kovu

  Hi, there is a poker-system in java, that uses Collections.shuffle() on all available cards before the cards are dealt. So a collection of 52 cards 2-9, J, Q, K, A in 4 types. After that we Collections.shuffle(). The problem is, that it seems (until now we didn't have big statistic, it's possible that we only see a lot of statistic inferences), that the algorithm is VERY unclearly. So, is Collections.shuffle() okay for a poker algorithm?

  Read the article

• Searching, Sorting and Graph Algorithms questions

  - by user177883

  Is there a resource that i can find different variations of searching, sorting and graph algorithm questions ? I have studied CLRS and Algorithm Design by Kleinberg. and solved some set of questions. I have also, checked SO for algorithms questions. Curious, if there is a resource you would highly recommend. EDIT: There is also this free ebook with many questions, that i was able to solve some of them.

  Read the article

• Algorithms for subgraph isomorphism detection

  - by Jack

  This a NP Complete problem. More info can be found here http://en.wikipedia.org/wiki/Subgraph_isomorphism_problem The most widely used algorithm is the one proposed by Ullman. Can someone please explain the algorithm to me. I read a paper by him and couldn't understand much. Also what other algorithms for this problem. I am working on an image processing project.

  Read the article

• String searching algorithm for Chinese characters.

  - by Jack Low

  There are Python code available for existing algorithms for normal string searching e.g. Boyer-Moore Algorithm. I am looking to use this on Chinese characters and it doesn't seem like the same implementation would work. What would I go about doing in order to make the algorithm work on Chinese characters? I am referring to this: http://en.literateprograms.org/Boyer-Moore_string_search_algorithm_(Python)#References

  Read the article

• What container is eaziest for combining Jpegs and MP3s as video?

  - by Ole Jak

  So I have N (for example 1000) Jpeg frames and 10*N ( for ex 100) seconds of MP3 sound I need some conteiner for Joining them into one Video file (10 frames/second) (beter popular like FLV or AVI or MOV). So what I need is algorithm or code example of combining my data into some popular format. (code example beter be in some language like C# Java or ActionScript or PHP, Algorithm should be theoreticly Implementable with ActionScript or PHP) Can any one, please help me with that?)

  Read the article

• breadth first or depth first search

  - by endroix

  I know how this algorithm works, but cant decide when to use which algorithm ? Are there some guidelines, where one better perform than other or any considerations ? Thanks very much.

  Read the article

• A minimum spanning tree / shortest path in a directed graph

  - by mvid

  Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist). Does such an algorithm exist?

  Read the article

• Dijkstra's algorithm to find all the shortest paths possible

  - by Darksody

  Hello, I'm working on Dijkstra's algorithm,and i really need to find all the possible shortest paths,not just one.I'm using an adjacency matrix and i applied Dijkstra's algorithm,and i can find the shortest path.But i need to find all the paths with that minimum cost,i mean all the possible solutions,if they exist.If anyone have an ideea and can help me,i would really appreciate it.A link would be fine too. Thank you.

  Read the article

• finding two most distant elements in a binary tree

  - by attwad

  I am looking for an algorithm that could find the two most distant elements in a binary tree, not looking for any special language, just for the algorithm. Thanks.

  Read the article

• Efficiency of purely functional programming

  - by Sid

  Does anyone know what is the worst possible asymptotic slowdown that can happen when programming purely functionally as opposed to imperatively (i.e. allowing side-effects)? Clarification from comment by itowlson: is there any problem for which the best known non-destructive algorithm is asymptotically worse than the best known destructive algorithm, and if so by how much?

  Read the article

• A[i] * A[j] = k in O(nlog(n))

  - by gleb-pendler

  A is an Array of n positive int numbers k given int Algorithm should find if there is a pair of numbers which product gives the result a. A[i] * A[j] = k b. A[i] = A[j] + k if there is such a couple the algorithm should return thier index. thanks in advance.

  Read the article

• Java - Collections.sort() performance

  - by msr

  Hello, Im using Collections.sort() to sort a LinkedList whose elements implements Comparable interface, so they are sorted in a natural order. In the javadoc documentation its said this method uses mergesort algorithm wich has n*log(n) performance. My question is if there is a more efficient algorithm to sort my LinkedList? The size of that list could be very high and sort will be also very frequent. Thanks!

  Read the article

• Algorithm for multiple word matching in a text, count the number of every matched word

  - by 66

  I have noticed that it has solutions for matching multiple words in a given text, such as below: http://stackoverflow.com/questions/1099985/algorithm-for-multiple-word-matching-in-text If I want to know exactly the number of appearances of each matched word in the text, my solution is like this: step 1: using ac-algorithm to obtain the maching words; step 2: count the number of each word obtained in step 1 is there a faster way? Thx~

  Read the article

• Antialiasing algorithm

  - by y_nk

  Hello, I'm looking for a good way to antialias a bitmap i'm generating with actionscript3. My goal would be to achieve this processing from scratch. I read a lot on the subject but the most common algorithm are looking too loud to work properly within my swf, because i'm using a scale2x algorithm to smooth the edges of my shape. It doesn't have to be colorfull, since my shape is black and white ! Any hint would be appreciated, thanks :)

  Read the article

• A two way minimum spanning tree of a directed graph

  - by mvid

  Given a directed graph with weighted edges, what algorithm can be used to give a sub-graph that has minimum weight, but allows movement from any vertex to any other vertex in the graph (under the assumption that paths between any two vertices always exist). Does such an algorithm exist?

  Read the article

• Finding partial substrings within a string

  - by Peter Chang

  I have two strings which must be compared for similarity. The algorithm must be designed to find the maximal similarity. In this instance, the ordering matters, but intervening (or missing) characters do not. Edit distance cannot be used in this case for various reasons. The situation is basically as follows: string 1: ABCDEFG string 2: AFENBCDGRDLFG the resulting algorithm would find the substrings A, BCD, FG I currently have a recursive solution, but because this must be run on massive amounts of data, any improvements would be greatly appreciated

  Read the article

• fft algorithm implementation with hadoop

  - by haluk

  Hi, I want to implement Fast Fourier Transform algorithm with Hadoop. I know recursive-fft algorithm but I need your guideline in order to implement it Map/Reduce approach. Any suggestions? Thanks.

  Read the article

• best algorithm for swapping?

  - by ashish yadav

  i have heard from a friend of mine that the best algorithm for swapping is " (a^=b^=a^=b)" where a and b are two integers to be swapped. but when i applied this using c language it resulted in crashing. can anyone of you fine people explain the possible reason for that? please suggest the best algorithm for swapping. thank you!!!!

  Read the article

• Balancing heuristics (for timetable problem)

  - by genesiss

  I'm writing a genetic algorithm for generating timetables. At the moment I'm using these two heuristics: Number of holes between lectures in one day (related) (less holes - bigger score) Each hour has some value, so for each timetable I sum values for hours when lectures are on. (lectures at more appropriate hours - bigger score) I want to balance these two heuristics, so the algorithm wouldn't favor neither one. What would be the best way to achieve this?

  Read the article

• Are there algorithms for increasing resolution of an image?

  - by David

  Are there any algorithms or tools that can increase the resolution of an image - besides just a simple zoom that makes each individual pixel in the image a little larger? I realize that such an algorithm would have to invent pixels that don't really exist in the original image, but I figured there might be some algorithm that could intelligently figure out what pixels to add to the image to increase its resolution.

  Read the article

• Variation on Hamiltonian path problems

  - by Robert

  Thinking about if we modify the definition of Hamiltonian path as we need to go through every edge once,but can pass vertex any times,is there still an algorithm available? How should I modify the original Hamiltonian algorithm to account for this?

  Read the article

• Find if there is an element repeating itself n/k times

  - by gleb-pendler

  You have an array size n and a constant k (whatever) You can assume the the array is of int type (although it could be of any type) Describe an algorithm that finds if there is an element(s) that repeats itself at least n/k times... if there is return one. Do so in linear time (O(n)) The catch: do this algorithm (or even pseudo-code) using constant memory and running over the array only twice

  Read the article

• Challenging question find if there is an element repeating himself n/k times

  - by gleb-pendler

  here how it's goes: You have an array size n and a constant k (whatever) you can assume the the array of int type tho it kind be of whatever type but just for the clearane let assume it's an integer. Describe an algorithm that finds if there is an element/s that repeat itself at least n/k times... if there is return one - do it in linear time running O(n) Imortent: now the catch do this algorithm or even pseuo-code using a constant usage of memory and running over the array only TWICE!!!

  Read the article

< Previous Page | 35 36 37 38 39 40 41 42 43 44 45 46  | Next Page >