Sciweavers

360 search results - page 42 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
ML
2000
ACM
126views Machine Learning» more  ML 2000»
13 years 8 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver
AIPS
2006
13 years 10 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang
AAAI
2008
13 years 11 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
WWW
2009
ACM
14 years 9 months ago
Learning to recognize reliable users and content in social media with coupled mutual reinforcement
Community Question Answering (CQA) has emerged as a popular forum for users to pose questions for other users to answer. Over the last few years, CQA portals such as Naver and Yah...
Jiang Bian, Yandong Liu, Ding Zhou, Eugene Agichte...
LWA
2007
13 years 10 months ago
Parameter Learning for a Readability Checking Tool
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
Tim vor der Brück, Johannes Leveling