1290 search results - page 228 / 258 » New algorithms of the Q-learning type |
CGF
2008
13 years 8 months ago
2008
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
DLOG
2010
13 years 6 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
SIAMCOMP
2002
13 years 8 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
CAV
2010
Springer
14 years 15 days ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
SSD
2007
Springer
14 years 2 months ago
2007
Springer
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...