5316 search results - page 208 / 1064 » Which Search Problems Are Random |
130
click to vote
UAI
2000
15 years 5 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
130
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
126
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
131
click to vote
TSP
2010
14 years 10 months ago
2010
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
124
Voted
AAAI
2000
15 years 5 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...