In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sudoku.Our survey of applications shows the difference map algorithm often achieves results comparable to much more sophisticated, special purpose algorithms. Efficient implementations of constraint projections usually are easier than designing the linear program solver at the heart of many optimization algorithms.
Author Daniel Sanchez-Crespo outlines a core programming curriculum every game designer should be well versed in. Code samples use C++, and the OpenGL and DirectX APIs.
takes a two-dimensional image and creates a three-dimensional "fly around" model, giving the viewers access to the scene's depth and a range of points of view.
Memetic Algorithms is a population-based approach for heuristic search in optimization problems. They have shown that they are orders of magnitude faster than traditional Genetic Algorithms for some problem domains.
Encryption Toolkit that provides anyone with the ability to add strong security capabilities to an application in as little as half an hour, without needing to know any of the low-level details that make the encryption or authentication work.
concerning "Lock-Free" and "Wait-Free" algorithms and data structures. These techniques allow concurrent update of shared data structures without resorting to critical sections protected by operating system managed locks.
to aid in the development of applications that use genetic, or evolutionary, algorithms. It provides data structures and functions for handling and manipulation of the data required for serial and parallel evolutionary algorithms.
an edited reprint of the paper What Every Computer Scientist Should Know About Floating-Point Arithmetic, by David Goldberg, published in the March, 1991 issue of Computing Surveys. Copyright 1991
In k-means clustering we are given a set of n data points in d-dimensional space and an integer k, and the problem is to determine a set of k points in d-space, called centers, so as to minimize the mean squared distance from each data point to its neares
a freely available commonsense knowledgebase and natural-language-processing toolkit which supports many practical textual-reasoning tasks over real-world documents right out-of-the-box (without additional statistical training)
a set of C++ genetic algorithm objects. The library includes tools for using genetic algorithms to do optimization in any C++ program using any representation and genetic operators. Part seems to be GPL (drats)
Li Fan, Pei Cao and Jussara Almeida & Andrei Z. Broder - this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries.
Diagramming in your web browser without downloading additional software Desktop application feel in a web-based diagramming solution Add collaborators to your work and watch it grow Link to published Gliffy drawings from your blog or wiki Create m
Search algorithms & popularity factors: link, social, click, blog, industry. Since modern search engines are concerned with popularity and not direct relevancy, & big firms up the price of text link buying beyond affordability...
A Tutorial and Recipe Book for Those in a Hurry - Provides an owerview of what can be done with the BioJava API: All sorts of string manipulation, HMMs, Trees etc.
The process of writing large parallel programs is complicated by the need to specify both the parallel behaviour of the program and the algorithm that is to be used to compute its result.
This project contains Naive and Fishers bayesian classifiers, as described in Toby Segaran's book "Programming Collective Intelligence." The book has python implementations; this is a Java implementation.
J. Handler, C. Feied, M. Smith, and M. Gillam. AMIA Annu Symp Proc, (2006)Handler, Jonathan Feied, Craig Smith, Mark Gillam, Michael United States AMIA ... Annual Symposium proceedings / AMIA Symposium. AMIA Symposium.
S. Dughmi. (2009)cite arxiv:0912.0322Comment: This revision corrects an error in definition 2.2, as well as provides additional intuition regarding the definitions of convex closure and concave closure.