Search Results

Search found 5638 results on 226 pages for 'scheduling algorithm'.

Page 54/226 | < Previous Page | 50 51 52 53 54 55 56 57 58 59 60 61  | Next Page >

• count of paths from A[a,b] to A[c,d] without duplicating?

  - by Sorush Rabiee

  I write a sokoban solver for fun and practice, it uses a simple algorithm (something like BFS). now i want to estimate its running time ( O and omega). but i need to know how to calculate count of paths from a vertex to another in a network. each path from a to b is a sequence of edges with no circuit. for example this is a correct path: http://www.imgplace.com/viewimg143/4789/501k.png but this is not: http://www.imgplace.com/viewimg143/6140/202.png

  Read the article

• How to balance number of ratings versus the ratings themselves?

  - by zneak

  Hello guys, For a school project, we'll have to implement a ranking system. However, we figured that a dumb rank average would suck: something that one user ranked 5 stars would have a better average that something 188 users ranked 4 stars, and that's just stupid. So I'm wondering if any of you have an example algorithm of "smart" ranking. It only needs to take in account the rankings given and the number of rankings. Thanks!

  Read the article

• Pluralize - Singularize

  - by Ronnie

  Is there any algorithm in c# to singularize - pluralize a word (in english) or does exist a .net library to do this (may be also in different languages)?

  Read the article

• How can I transform latitude and longitude to x,y in Java?

  - by hory.incpp

  Hello, I am working on a geographic project in Java. The input are coordinates : 24.4444 N etc Output: a PLAIN map (not round) showing the point of the coordinates. I don't know the algorithm to transform from coordinates to x,y on a JComponent, can somebody help me? The map looks like this: http://upload.wikimedia.org/wikipedia/commons/7/74/Mercator-projection.jpg Thank you

  Read the article

• Does Python/Scipy have a firls( ) replacement (i.e. a weighted, least squares, FIR filter design)?

  - by delicasso

  I am porting code from Matlab to Python and am having trouble finding a replacement for the firls( ) routine. It is used for, least-squares linear-phase Finite Impulse Response (FIR) filter design. I looked at scipy.signal and nothing there looked like it would do the trick. Of course I was able to replace my remez and freqz algorithsm, so that's good. On one blog I found an algorithm that implemented this filter without weighting, but I need one with weights. Thanks, David

  Read the article

• Need algorithm to add Node in binary tree

  - by m.qayyum

  •if your new element is less or equal than the current node, you go to the left subtree, otherwise to the right subtree and continue traversing •if you arrived at a node, where you can not go any deeper, because there is no subtree, this is the place to insert your new element (5)Root (3)-------^--------(7) (2)---^----(5) ^-----(8) (5)--^ i want to add this last node with data 5...but i can't figure it out...I need a algorithm to do that or in java language

  Read the article

• Sorting an array with two values

  - by davit-datuashvili

  I have array of colors: String s[]=new String[]{"red","black..............}; The only possible colors are red and black. I need an algorithm which partitions the array such that all red come before all black. How can I compare/exchange them to accomplish that?

  Read the article

• C++ : Math library that solve system of equations using back substitution algorithm

  - by Harry Pham

  If I have this: A * f = g; A: upper triangular matrix (n x n) f: (n x 1) g: (n x 1) Need to solve for f using back substitution algorithm. I would say that it not really that hard to write one myself, but oh well, if there is a library out there, then why not.

  Read the article

• How do I calculate the week number given a date?

  - by GH

  If I have a date, how do I calculate the week number for that date within that year? For example, in 2008, January 1st to January 6th are in week 1 and January 7th to the 13th are in week 2, so if my date was January 10th 2008, my week number would be 2. An algorithm would be great to get me started and sample code would also help - I'm developing in C++ on Windows. Related: Getting week number off a date in MS SQL Server 2005?

  Read the article

• Finding max clique in perfect graphs

  - by copperhead

  A fast algorithm to find the size of the largest clique in a perfect graph(this one having odd cycles with at least 1 chord) with about 100 vertices ??

  Read the article

• What is the most efficient way to determine if a directed graph is singly connected?

  - by zebraman

  I am working on an assignment where one of the problems asks to derive an algorithm to check if a directed graph G=(V,E) is singly connected (there is at most one simple path from u to v for all distinct vertices u,v of V. Of course you can brute force check it, which is what I'm doing right now, but I want to know if there's a more efficient way. Could anyone point me in the right direction?

  Read the article

• graph algorithms

  - by davit-datuashvili

  now one ask please help me to write a few graph algorithms for example http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm there is given such graph my problem is that i want implement graph algorithms on arrays can anybody help me to imlement ddijkstra algorithm on array i want to see one example because it is difficulty for me to understand this pseudocodes which is in internet i mean classes edges and so on please help me

  Read the article

• Balancing a Binary Tree (AVL)

  - by Gustavo Carreno

  Ok, this is another one in the theory realm for the CS guys around. In the 90's I did fairly well in implementing BST's. The only thing I could bever get my head around was the intricacy of the algorithm to balance a Binary Tree (AVL). Can you guys help me on this?

  Read the article

• Object Pooling managment algorithm.

  - by Talha Bin Shakir

  Hi, Anyone can help me to write an algorithm for object pooling. I am very new in J2EE and i need object pooling for database connection. So please help out. Thanks

  Read the article

• Dijkstra's Algorithm explanation java

  - by alchemey89

  Hi, I have found an implementation for dijkstras algorithm on the internet and was wondering if someone could help me understand how the code works. Many thanks private int nr_points=0; private int[][]Cost; private int []mask; private void dijkstraTSP() { if(nr_points==0)return; //algorithm=new String("Dijkstra"); nod1=new Vector(); nod2=new Vector(); weight=new Vector(); mask=new int[nr_points]; //initialise mask with zeros (mask[x]=1 means the vertex is marked as used) for(int i=0;i<nr_points;i++)mask[i]=0; //Dijkstra: int []dd=new int[nr_points]; int []pre=new int[nr_points]; int []path=new int[nr_points+1]; int init_vert=0,pos_in_path=0,new_vert=0; //initialise the vectors for(int i=0;i<nr_points;i++) { dd[i]=Cost[init_vert][i]; pre[i]=init_vert; path[i]=-1; } pre[init_vert]=0; path[0]=init_vert; pos_in_path++; mask[init_vert]=1; for(int k=0;k<nr_points-1;k++) { //find min. cost in dd for(int j=0;j<nr_points;j++) if(dd[j]!=0 && mask[j]==0){new_vert=j; break;} for(int j=0;j<nr_points;j++) if(dd[j]<dd[new_vert] && mask[j]==0 && dd[j]!=0)new_vert=j; mask[new_vert]=1; path[pos_in_path]=new_vert; pos_in_path++; for(int j=0;j<nr_points;j++) { if(mask[j]==0) { if(dd[j]>dd[new_vert]+Cost[new_vert][j]) { dd[j]=dd[new_vert]+Cost[new_vert][j]; } } } } //Close the cycle path[nr_points]=init_vert; //Save the solution in 3 vectors (for graphical purposes) for(int i=0;i<nr_points;i++) { nod1.addElement(path[i]); nod2.addElement(path[i+1]); weight.addElement(Cost[path[i]][path[i+1]]); } }

  Read the article

• Fastest method implementing number multiplication in strings (1000000 digits)

  - by Svisstack

  Hello, I want to write fastest possible algorithm for 2 number multiplications. Each number has max digits around 1000000 and is contained in string. Anyone want to tell about this problem? I searching really speed solution.

  Read the article

• What are the real-world applications of huffman coding?

  - by jcyang

  I am told that Huffman coding is used as loseless data compression algorithm but also am told that real data compress software do not employ huffman coding,cause if the keys are not distributed decentralized enough,the compressed file could be even larger than the orignal file. This leave me wondering are there any real-world application of huffman coding? thanks.

  Read the article

• What is the best approximation in salesman problem?

  - by Svisstack

  Hello, I want to know what algorithm do best approximation on salesman problem, and in what scale this approximation like to be a optimal solve (%?) Anyone can help me on this?

  Read the article

• Fastest method implementing number sqare root in string (1000000 digits)

  - by Svisstack

  Hello, What is fastest algorithm implementing a square root of decimal contained in strings. This decimal can have 1000000 digits. Anyone can tell me something about it?

  Read the article

• effective functional sort

  - by sreservoir

  I'm programming a function for a TI-NSpire, so I can't use the builtins from inside a function. What is the most generally efficient algorithm for sorting a list of numbers without modifying the list itself? (recursion and list-splitting are fair game, as is general use of math.)

  Read the article

• Is there a way to figure out the true bit rate of an audio file?

  - by The Rook

  Lets say you have a 96 kbit mp3 and you Transcode the file into a 320 kbit mp3. How could you programmatically detect the original bit rate? Does one exist or how should I approach this problem? Perhaps an algorithm to detect Generation Loss could be used.

  Read the article

• Stopping Backtracking

  - by John Retallack

  Is there any way in C/C++ to stop a backtracking algorithm after finding the first solution without exiting the program. I want my function to immediately exit the function,not to quit every level of recurrsion one by one stating return.

  Read the article

• recursive add binary numbers

  - by davit-datuashvili

  i need following algorithm let say we have 5 //101 and 7 //111 numbers are arbitrary i need to add these numbers using the recursive method and at the same time using bitwise methods such that result should be 101 + 111 110 0 or 12 can anybody help me?

  Read the article

• What encryption algorithm is best for small strings ?

  - by Lee Shtoy

  Hey, I have a string of 10-15 characters and I want to encrypt that string. The problem is - I want to get a shortest encrypted string as possible. I will also want to decrypt that string back to its original string. Which encryption algorithm fits best to this situation ? Thanks

  Read the article

• Matching between product and customer personal information

  - by Yanshof

  I writing some application that find ( according to some question ) information about some person ( lets say that the information are weight, hight and age of the person ). In the other hand i have product list ( can be very big one ) and according to the product information i need to find the best matching between the person information and the product ( the product information that i have are water part, nitrogen part and ext. ) I can't use flow chart algorithm or Breadth-first search because the number of the product is dynamically ( read the product list from DB ... )

  Read the article

< Previous Page | 50 51 52 53 54 55 56 57 58 59 60 61  | Next Page >