Sciweavers

6926 search results - page 1129 / 1386
» A More Effective CEFF
Sort
View
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
16 years 1 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
SEMWEB
2009
Springer
16 years 1 months ago
Coloring RDF Triples to Capture Provenance
Abstract. Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and know...
Giorgos Flouris, Irini Fundulaki, Panagiotis Pedia...
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
184
Voted
HT
2009
ACM
16 years 1 months ago
Improving recommender systems with adaptive conversational strategies
Conversational recommender systems (CRSs) assist online users in their information-seeking and decision making tasks by supporting an interactive process. Although these processes...
Tariq Mahmood, Francesco Ricci
ISSTA
2009
ACM
16 years 1 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
« Prev « First page 1129 / 1386 Last » Next »