Sciweavers

2412 search results - page 139 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
115
Voted
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
15 years 9 months ago
Zonal Co-location Pattern Discovery with Dynamic Parameters
Zonal co-location patterns represent subsets of featuretypes that are frequently located in a subset of space (i.e., zone). Discovering zonal spatial co-location patterns is an im...
Mete Celik, James M. Kang, Shashi Shekhar
101
Voted
CP
2006
Springer
15 years 7 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
IJCAI
2003
15 years 4 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
121
Voted
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 5 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
134
Voted
CORR
2006
Springer
125views Education» more  CORR 2006»
15 years 3 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski