- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence 172 (8-9):955-990 (2008)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT.Holger H. Hoos & Thomas Stützle - 1999 - Artificial Intelligence 112 (1-2):213-232.
Configuration landscape analysis and backbone guided local search.Weixiong Zhang - 2004 - Artificial Intelligence 158 (1):1-26.
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks.Weixiong Zhang, Guandong Wang, Zhao Xing & Lars Wittenburg - 2005 - Artificial Intelligence 161 (1-2):55-87.
確率的制約充足アルゴリズムにおける局所最適構造.西原 清一 水野 一徳 - 2001 - Transactions of the Japanese Society for Artificial Intelligence 16:38-45.
Exact stochastic constraint optimisation with applications in network analysis.Anna L. D. Latour, Behrouz Babaki, Daniël Fokkinga, Marie Anastacio, Holger H. Hoos & Siegfried Nijssen - 2022 - Artificial Intelligence 304 (C):103650.
Local search characteristics of incomplete SAT procedures.Dale Schuurmans & Finnegan Southey - 2001 - Artificial Intelligence 132 (2):121-150.
New local search methods for partial MaxSAT.Shaowei Cai, Chuan Luo, Jinkun Lin & Kaile Su - 2016 - Artificial Intelligence 240 (C):1-18.
Local search for Boolean Satisfiability with configuration checking and subscore.Shaowei Cai & Kaile Su - 2013 - Artificial Intelligence 204 (C):75-98.
Local search with constraint propagation and conflict-based heuristics.Narendra Jussien & Olivier Lhomme - 2002 - Artificial Intelligence 139 (1):21-45.
Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.
Analytics
Added to PP
2020-12-22
Downloads
5 (#847,061)
6 months
3 (#1,723,834)
2020-12-22
Downloads
5 (#847,061)
6 months
3 (#1,723,834)
Historical graph of downloads
Citations of this work
Understanding the scalability of Bayesian network inference using clique tree growth curves.Ole J. Mengshoel - 2010 - Artificial Intelligence 174 (12-13):984-1006.
References found in this work
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
Local search characteristics of incomplete SAT procedures.Dale Schuurmans & Finnegan Southey - 2001 - Artificial Intelligence 132 (2):121-150.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-grz79 uwo