Search Results

Search found 1933 results on 78 pages for 'genetic algorithms'.

Page 46/78 | < Previous Page | 42 43 44 45 46 47 48 49 50 51 52 53  | Next Page >

• How do I arbitrarily distort a textured polygon?

  - by Archagon

  I'd like to write a program that lets me arbitrarily distort a textured polygon by dragging its vertices. I want the texture to distort fluidly and without overlap, assuming the new polygon doesn't intersect itself. I should also be able to repeat the process with the new shape, and with a minimum amount of loss. Are there any algorithms for doing this?

  Read the article

• Handling User Authentication in .NET?

  - by Daniel

  I am new to .NET, and don't have much experience in programming. What is the standard way of handling user authentication in .NET in the following situation? In Process A, User inputs ID/Password Process A sends the ID/Password to Process B over a nonsecure public channel. Process B authenticates the user with the recieved ID/Password what are some of the standard cryptographic algorithms I can use in above model?

  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

• Calculate the Hilbert value of a point for use in a Hilbert R-Tree?

  - by wrt

  I have an application where a Hilbert R-Tree (wikipedia) (citeseer) would seem to be an appropriate data structure. Specifically, it requires reasonably fast spatial queries over a data set that will experience a lot of updates. However, as far as I can see, none of the descriptions of the algorithms for this data structure even mention how to actually calculate the requisite Hilbert Value; which is the distance along a Hilbert Curve to the point. So any suggestions for how to go about calculating this?

  Read the article

• What kind of data processing problems would CUDA help with?

  - by Chris McCauley

  Hi, I've worked on many data matching problems and very often they boil down to quickly and in parallel running many implementations of CPU intensive algorithms such as Hamming / Edit distance. Is this the kind of thing that CUDA would be useful for? What kinds of data processing problems have you solved with it? Is there really an uplift over the standard quad-core intel desktop? Chris

  Read the article

• Why is it useful to count the number of bits?

  - by Scorchin

  I've seen the numerous questions about counting the number of set bits in a insert type of input, but why is it useful? For those looking for algorithms about bit counting, look here: http://stackoverflow.com/questions/1517848/counting-common-bits-in-a-sequence-of-unsigned-longs http://stackoverflow.com/questions/472325/fastest-way-to-count-number-of-bit-transitions-in-an-unsigned-int http://stackoverflow.com/questions/109023/best-algorithm-to-count-the-number-of-set-bits-in-a-32-bit-integer

  Read the article

• Big O, how do you calculate/approximate it?

  - by Sven

  Most people with a degree in CS will certainly know what Big O stands for. It helps us to measure how (in)efficient an algorithm really is and if you know in what category the problem you are trying to solve lays in you can figure out if it is still possible to squeeze out that little extra performance.* But I'm curious, how do you calculate or approximate the complexity of your algorithms? *: but as they say, don't overdo it, premature optimization is the root of all evil, and optimization without a justified cause should deserve that name as well.

  Read the article

• How to fit a custom graph to the boost graph library template?

  - by Michael

  I'm rusty on C++ templates and I'm using the boost graph library (a fatal combination). I've searched the web and can't find any direct instructions on how to take a custom graph structure and fit enough of it to BGL (boost graph library) that I can use boosts graph traversing algorithms. Anyone familiar enough with the library to help me out?

  Read the article

• Controlled execution of computationally expensive tasks

  - by Sergio

  Say you have an application where a user is typing some text and as she types you'd want to perform some expensive computations in the background (related to the text that is being typed). Although you would like to do lots of things, your main priority is that the system responsiveness stay at acceptable levels so the user doesn't notice such a heavy load. Is there a way (ideally platform/language independent) to control what algorithms should be executed in the background based on the system load and responsiveness?

  Read the article

• Algorithm for data alignment of float arrays in Java

  - by Derk

  I have two float arrays representing y values in a line chart. Now I want to align these two charts. Are there any existing algorithms for alignment of the two arrays? A very simple example a: 2.5 1.3 1.6 4.2 3.6 b: 3.3 1.4 2.5 1.3 1.6 Now after alignment it should be: 2.5 1.3 1.6 4.2 3.6 3.3 1.4 2.5 1.3 1.6

  Read the article

• Most valuable course in the CS degree.

  - by danielrutledge

  I was a math major and I took OOP and Algorithms & Data Structures from the CS department while in school, but didn't continue to any upper-division courses. What were the most valuable courses to your programming career (Operating systems, Compiler Design, Computer architecture, etc) in your CS degree? Alternatively, if you're like me and don't have one, are there any courses you wish you had taken? What would be the best way to fill in the gaps in my knowledge outside of school?

  Read the article

• reflection paths between points in2d

  - by Chris H

  Just wondering if there was a nice (already implemented/documented) algorithm to do the following Given any shape (without crossing edges) and two points inside that shape, compute all the paths between the two points such that all reflections are perfect reflections. The path lengths should be limited to a certain length otherwise there are infinite solutions. I'm not interested in just shooting out rays to try to guess how close I can get, I'm interested in algorithms that can do it perfectly. Search based, not guess/improvement based.

  Read the article

• Cpu schedule, removing thread from queue

  - by Kamil

  I'm implementing now CPU schedule algorithms FCFS, SJF and Round Robin. Could somebody tell when process is removed from queue (FCFS,SJF,RR)? I mean, first CPU execute thread and after executing remove from queue or the other way around?

  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

• Colloborative filtering

  - by Pranay Kumar

  How can i use SVD algorithm in mahout for producing recommendations on explicit binary data-set (eg. a user purchased or not but no specific ratings ) in an e-commerce domain ? Also what algorithms aim at producing recommendations on such binary data-sets ? Thanks in advance. Pranay Kumar, 2nd yr,cse

  Read the article

• HPC (mainly on Java)

  - by Insectatorious

  I'm looking for some way of using the number-crunching ability of a GPU (with Java perhaps?) in addition to using the multiple cores that the target machine has. I will be working on implementing (at present) the A* Algorithm but in the future I hope to replace it with a Genetic Algorithm of sorts. I've looked at Project Fortress but as I'm building my GUI in JavaFX, I'd prefer not to stray too far from a JVM. Of course, should no feasible solution be available, I will migrate to the easiest solution to implement.

  Read the article

• Finding patterns in source code

  - by trex279

  If I wanted to learn about pattern recognition in general what would be a good place to start (recommend a book)? Also, does anybody have any experience/knowledge on how to go about applying these algorithms to find abstraction patterns in programs? (repeated code, chunks of code that do the same thing, but in slightly different ways, etc.) Thanks Edit: I don't mind mathematically intensive books. In fact, that would be a good thing.

  Read the article

• Latex: Listing all figures (tables, algorithm) once again at the end of the document

  - by Zlatko

  Hi all, I have been writhing a rather large document with latex. Now I would like to list all the figures / tables / algortihms once again at the end of the file so that I can check if they all look the same. For example, if every algorithm has the same notation. How can I do this? I know about \listofalgorithms and \listoffigures but they only list the names of the algorithms or figures and the pages where they are. Thanks.

  Read the article

• Simple C image library?

  - by Timmy

  What's the simplest C image library for loading and saving? I just want a 2D array to test some algorithms, and built-in functions are not needed.

  Read the article

• Using static vs. member find method on a STL set?

  - by B Johnson

  I am using a set because, i want to use the quick look up property of a sorted container such as a set. I am wondering if I have to use the find member method to get the benefit of a sorted container, or can I also use the static find method in the STL algorithms? My hunch is that using the static version will use a linear search instead of a binary search like I want.

  Read the article

• Reimplementing data structures in the real world

  - by Jason

  The topic of algorithms class today was reimplementing data structures, specifically ArrayList in Java. The fact that you can customize a structure for in various ways definitely got me interested, particularly with variations of add() & iterator.remove() methods. But is reimplementing and customizing a data structure something that is of more interest to the academics vs the real-world programmers? Has anyone reimplemented their own version of a data structure in a commercial application/program, and why did you pick that route over your particular language's implementation?

  Read the article

• What algorithm .Net use for searching a pattern in a string?

  - by Hun1Ahpu

  I'm studying string searching algorithms now and wondering what algorithm is used for .NET String.Contains function for example. Reflector shows that this function is used but I have no idea what its name means. private static extern int InternalFindNLSStringEx(IntPtr handle, string localeName, int flags, string source, int sourceCount, int startIndex, string target, int targetCount);

  Read the article

• What is the best emulator for MIX and/or MMIX?

  - by CrashCodes

  MIX is the hypothetical computer outlined by Donald Knuth in the Art of Computer Programming. I guess when I say best, I mean most suitable for working with the algorithms and problems in the Art of Computer Programming.

  Read the article

• Version of STL optimized for compile time?

  - by anon

  Hi! I'm looking for a variant of the STL (it's okay if it doesn't have all the functionality) that's optimized for short compile times -- I get bothered by long compile times that delay my compile-debug-edit cycle. I'm mainly interested in the containers of the STL: vector/map, and not so much the algorithms. Thanks!

  Read the article

• What is the difference between DSA and RSA?

  - by WilliamKF

  It appears they are both encryption algorithms that require public and private keys. Why would I pick one versus the other to provide encryption in my client server application?

  Read the article

< Previous Page | 42 43 44 45 46 47 48 49 50 51 52 53  | Next Page >