9842 search results - page 1366 / 1969 » Problem complexity |
181
click to vote
IJCAI
1989
15 years 8 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
195
Voted
CN
2007
15 years 7 months ago
2007
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
246
Voted
JMLR
2008
15 years 7 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
222
Voted
SIAMCOMP
2008
15 years 7 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
193
Voted
JC
2000
15 years 7 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...