1469 search results - page 175 / 294 » Approximate polynomial decomposition |
170
click to vote
AAAI
2006
15 years 7 months ago
2006
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
157
click to vote
DCG
2010
15 years 6 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
172
click to vote
AICOM
2006
15 years 6 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
145
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
Abstract. The paper addresses the problem of discrimination of homographs when a lengthy segment of an uttered word is missing. The considered discrimination procedure is done by r...
173
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...