This is the
talk page for discussing improvements to the
Local search (optimization) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
Silvery has suggested to change the name of this article into something like Local search (algorithmic technique) or similar to avoid the possible ambiguity with the sense "optimization of local search on the web". While I do not like much the idea that articles on well-established research concepts must take a name or another depending on a newer but more polular concept, I understand that that the new name will be less ambigous. Therefore, I do not oppose to the name change. Paolo Liberatore ( Talk) 23:47, 19 October 2005 (UTC)
I removed "approximately" from the line "Examples of problems that can be approximately solved by local search are:". I think it is ment to indicate that local search is sometimes used to find "nearly optimal" solutions but this is not always the case. For boolean satisfiability and TSP it can be used to solve the problem. I'm not sure about vertex covereing but I can find out. The difficulty arises from the fact that local search is used for both optimization and satisfiability. If someone can suggest a better fix, or would like to see a more detailed article, I would be happy to help. Sharp Tac 13:09, 22 November 2006 (UTC)
Merge with /info/en/?search=Local_search_%28constraint_satisfaction%29 ? — Preceding unsigned comment added by 81.164.155.169 ( talk) 17:02, 26 November 2016 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Local search (optimization). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 18 January 2022).
Cheers.— InternetArchiveBot ( Report bug) 22:59, 4 January 2018 (UTC)
This is the
talk page for discussing improvements to the
Local search (optimization) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google ( books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||
|
Silvery has suggested to change the name of this article into something like Local search (algorithmic technique) or similar to avoid the possible ambiguity with the sense "optimization of local search on the web". While I do not like much the idea that articles on well-established research concepts must take a name or another depending on a newer but more polular concept, I understand that that the new name will be less ambigous. Therefore, I do not oppose to the name change. Paolo Liberatore ( Talk) 23:47, 19 October 2005 (UTC)
I removed "approximately" from the line "Examples of problems that can be approximately solved by local search are:". I think it is ment to indicate that local search is sometimes used to find "nearly optimal" solutions but this is not always the case. For boolean satisfiability and TSP it can be used to solve the problem. I'm not sure about vertex covereing but I can find out. The difficulty arises from the fact that local search is used for both optimization and satisfiability. If someone can suggest a better fix, or would like to see a more detailed article, I would be happy to help. Sharp Tac 13:09, 22 November 2006 (UTC)
Merge with /info/en/?search=Local_search_%28constraint_satisfaction%29 ? — Preceding unsigned comment added by 81.164.155.169 ( talk) 17:02, 26 November 2016 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Local search (optimization). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 18 January 2022).
Cheers.— InternetArchiveBot ( Report bug) 22:59, 4 January 2018 (UTC)