5316 search results - page 270 / 1064 » Which Search Problems Are Random |
136
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
148
click to vote
JMLR
2010
14 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
142
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
128
Voted
AISC
2004
Springer
15 years 10 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
129
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...