| http://dbpedia.org/ontology/abstract
|
En informatique théorique, l'analyse lisse … En informatique théorique, l'analyse lisse d'algorithme (smoothed analysis) est une manière de mesurer la complexité d'un algorithme, c'est-à-dire ses performances. Elle complète et améliore les mesures classiques de complexité : la complexité dans le pire des cas, la complexité en moyenne et la complexité amortie. Elle a été inventée dans les années 2000 par Daniel Spielman et Shang-Hua Teng.000 par Daniel Spielman et Shang-Hua Teng.
, In theoretical computer science, smoothed … In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis has been used as a basis for considerable research, for problems ranging from mathematical programming, numerical analysis, machine learning, and data mining. It can give a more realistic analysis of the practical performance (e.g., running time, success rate, approximation quality) of the algorithm compared to analysis that uses worst-case or average-case scenarios. Smoothed analysis is a hybrid of worst-case and average-case analyses that inherits advantages of both. It measures the expected performance of algorithms under slight random perturbations of worst-case inputs. If the smoothed complexity of an algorithm is low, then it is unlikely that the algorithm will take a long time to solve practical instances whose data are subject to slight noises and imprecisions. Smoothed complexity results are strong probabilistic results, roughly stating that, in every large enough neighbourhood of the space of inputs, most inputs are easily solvable. Thus, a low smoothed complexity means that the hardness of inputs is a "brittle" property. Although worst-case analysis has been widely successful in explaining the practical performance of many algorithms, this style of analysis gives misleading results for a number of problems. Worst-case complexity measures the time it takes to solve any input, although hard-to-solve inputs might never come up in practice. In such cases, the worst-case running time can be much worse than the observed running time in practice. For example, the worst-case complexity of solving a linear program using the simplex algorithm is exponential, although the observed number of steps in practice is roughly linear. The simplex algorithm is in fact much faster than the ellipsoid method in practice, although the latter has polynomial-time worst-case complexity. Average-case analysis was first introduced to overcome the limitations of worst-case analysis. However, the resulting average-case complexity depends heavily on the probability distribution that is chosen over the input. The actual inputs and distribution of inputs may be different in practice from the assumptions made during the analysis: a random input may be very unlike a typical input. Because of this choice of data model, a theoretical average-case result might say little about practical performance of the algorithm. Smoothed analysis generalizes both worst-case and average-case analysis and inherits strengths of both. It is intended to be much more general than average-case complexity, while still allowing low complexity bounds to be proven.lowing low complexity bounds to be proven.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Every_pixel_has_a_random_color.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
18208194
|
| http://dbpedia.org/ontology/wikiPageLength
|
13460
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1106909130
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Linear_program +
, http://dbpedia.org/resource/Worst-case_analysis +
, http://dbpedia.org/resource/Nevanlinna_Prize +
, http://dbpedia.org/resource/Theoretical_computer_science +
, http://dbpedia.org/resource/Fulkerson_Prize +
, http://dbpedia.org/resource/EATCS +
, http://dbpedia.org/resource/Ellipsoid_method +
, http://dbpedia.org/resource/Analysis_of_algorithms +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
, http://dbpedia.org/resource/K-means_clustering +
, http://dbpedia.org/resource/Probability_density_function +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/American_Mathematical_Society +
, http://dbpedia.org/resource/Local_search_%28optimization%29 +
, http://dbpedia.org/resource/Linear_programming +
, http://dbpedia.org/resource/Shanghua_Teng +
, http://dbpedia.org/resource/2-opt +
, http://dbpedia.org/resource/Mathematical_programming +
, http://dbpedia.org/resource/Numerical_analysis +
, http://dbpedia.org/resource/Gaussian_distribution +
, http://dbpedia.org/resource/Data_mining +
, http://dbpedia.org/resource/G%C3%B6del_Prize +
, http://dbpedia.org/resource/Norm_%28mathematics%29 +
, http://dbpedia.org/resource/Average-case_complexity +
, http://dbpedia.org/resource/Average-case_analysis +
, http://dbpedia.org/resource/Daniel_Spielman +
, http://dbpedia.org/resource/Simplex_algorithm +
, http://dbpedia.org/resource/Alan_Edelman +
, http://dbpedia.org/resource/Weakly_polynomial +
, http://dbpedia.org/resource/NP-hard +
, http://dbpedia.org/resource/Pseudo-polynomial_time +
, http://dbpedia.org/resource/Traveling_salesman_problem +
, http://dbpedia.org/resource/Probability_distribution +
, http://dbpedia.org/resource/Association_for_Computing_Machinery +
, http://dbpedia.org/resource/Worst-case_complexity +
, http://dbpedia.org/resource/Mathematical_Programming_Society +
, http://dbpedia.org/resource/Approximation_ratio +
, http://dbpedia.org/resource/Category:Computational_complexity_theory +
, http://dbpedia.org/resource/File:Every_pixel_has_a_random_color.png +
, http://dbpedia.org/resource/File:Edible_fungi_in_basket_2012_G1.jpg +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Computational_complexity_theory +
, http://dbpedia.org/resource/Category:Mathematical_optimization +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Way +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Smoothed_analysis?oldid=1106909130&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Edible_fungi_in_basket_2012_G1.jpg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Every_pixel_has_a_random_color.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Smoothed_analysis +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.04cx6ry +
, http://fr.dbpedia.org/resource/Analyse_lisse_d%27algorithme +
, http://dbpedia.org/resource/Smoothed_analysis +
, https://global.dbpedia.org/id/4up7P +
, http://www.wikidata.org/entity/Q7546449 +
|
| rdfs:comment |
En informatique théorique, l'analyse lisse … En informatique théorique, l'analyse lisse d'algorithme (smoothed analysis) est une manière de mesurer la complexité d'un algorithme, c'est-à-dire ses performances. Elle complète et améliore les mesures classiques de complexité : la complexité dans le pire des cas, la complexité en moyenne et la complexité amortie. Elle a été inventée dans les années 2000 par Daniel Spielman et Shang-Hua Teng.000 par Daniel Spielman et Shang-Hua Teng.
, In theoretical computer science, smoothed … In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis has been used as a basis for considerable research, for problems ranging from mathematical programming, numerical analysis, machine learning, and data mining. It can give a more realistic analysis of the practical performance (e.g., running time, success rate, approximation quality) of the algorithm compared to analysis that uses worst-case or average-case scenarios.uses worst-case or average-case scenarios.
|
| rdfs:label |
Smoothed analysis
, Analyse lisse d'algorithme
|
