Sciweavers

CG
2006
Springer
13 years 8 months ago
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
Rémi Coulom
UIST
1994
ACM
13 years 8 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
13 years 8 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
CG
1998
Springer
13 years 8 months ago
From Simple Features to Sophisticated Evaluation Functions
This paper discusses a practical framework for the semi automatic construction of evaluation functions for games. Based on a structured evaluation function representation, a proced...
Michael Buro
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
13 years 9 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack
PPSN
2004
Springer
13 years 10 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
DIGRA
2005
Springer
13 years 10 months ago
Towards the unification of intuitive and formal game concepts with applications to computer chess
A general technique is proposed to deal with the formalization of intuition and human-oriented concepts in competition thinking games like chess, such as defensive play, attack, t...
Ariel Arbiser
ACG
2009
Springer
13 years 11 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
IAT
2009
IEEE
13 years 11 months ago
Automated Web Site Evaluation - An Approach Based on Ranking SVM
This paper proposes an automated web site evaluation approach using machine learning to cope with ranking problems. Evaluating web sites is a significant task for web service beca...
Peng Li, Seiji Yamada