Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Difference-map_algorithm> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Difference-map_algorithm abstract "The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space. Solutions are encoded as fixed points of the mapping.Although originally conceived as a general method for solving the phase problem, the difference-map algorithm has been used for the boolean satisfiability problem, protein structure prediction, Ramsey numbers, diophantine equations, and Sudoku, as well as sphere- and disk-packing problems. Since these applications include NP-complete problems, the scope of the difference map is that of an incomplete algorithm. Whereas incomplete algorithms can efficiently verify solutions (once a candidate is found), they cannot prove that a solution does not exist.The difference-map algorithm is a generalization of two iterative methods: Fienup's Hybrid input output (HIO) algorithm for phase retrieval and the Douglas-Rachford algorithm for convex optimization. Iterative methods, in general, have a long history in phase retrieval and convex optimization. The use of this style of algorithm for hard, non-convex problems is a more recent development.".
- Difference-map_algorithm thumbnail Iterations_0,_100,_200,_300_and_400_in_difference-map_reconstruction_of_grayscale_image_from_Fourier_transform_modulus.png?width=300.
- Difference-map_algorithm wikiPageID "10145406".
- Difference-map_algorithm wikiPageRevisionID "604784324".
- Difference-map_algorithm hasPhotoCollection Difference-map_algorithm.
- Difference-map_algorithm subject Category:Constraint_programming.
- Difference-map_algorithm subject Category:Search_algorithms.
- Difference-map_algorithm type Abstraction100002137.
- Difference-map_algorithm type Act100030358.
- Difference-map_algorithm type Activity100407535.
- Difference-map_algorithm type Algorithm105847438.
- Difference-map_algorithm type Event100029378.
- Difference-map_algorithm type Procedure101023820.
- Difference-map_algorithm type PsychologicalFeature100023100.
- Difference-map_algorithm type Rule105846932.
- Difference-map_algorithm type SearchAlgorithms.
- Difference-map_algorithm type YagoPermanentlyLocatedEntity.
- Difference-map_algorithm comment "The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space.".
- Difference-map_algorithm label "Difference-map algorithm".
- Difference-map_algorithm sameAs m.02q38wh.
- Difference-map_algorithm sameAs Q5275267.
- Difference-map_algorithm sameAs Q5275267.
- Difference-map_algorithm sameAs Difference-map_algorithm.
- Difference-map_algorithm wasDerivedFrom Difference-map_algorithm?oldid=604784324.
- Difference-map_algorithm depiction Iterations_0,_100,_200,_300_and_400_in_difference-map_reconstruction_of_grayscale_image_from_Fourier_transform_modulus.png.
- Difference-map_algorithm isPrimaryTopicOf Difference-map_algorithm.
