5316 search results - page 943 / 1064 » Which Search Problems Are Random |
135
Voted
SAT
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
113
click to vote
ACOM
2004
Springer
15 years 7 months ago
2004
Springer
The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we develop an extended versi...
130
click to vote
CSB
2004
IEEE
15 years 7 months ago
2004
IEEE
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
136
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
123
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
One problem faced in knowledge engineering for Bayesian networks is the exponential growth of the number of parameters in their conditional probability tables (CPTs). The most comm...