Sciweavers

442 search results - page 33 / 89
» Exploration in computer games - a new starting point
Sort
View
ICCV
2007
IEEE
16 years 1 months ago
Half Quadratic Analysis for Mean Shift: with Extension to A Sequential Data Mode-Seeking Method
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
Xiaotong Yuan, Stan Z. Li
ACG
2006
Springer
15 years 5 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy
ACL
2010
14 years 10 months ago
Collocation Extraction beyond the Independence Assumption
In this paper we start to explore two-part collocation extraction association measures that do not estimate expected probabilities on the basis of the independence assumption. We ...
Gerlof Bouma
WIOPT
2005
IEEE
15 years 5 months ago
A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition
Abstract— The ever-increasing popularity of web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given bi...
Navrati Saxena, Maria Cristina Pinotti, Kalyan Bas...
CG
1998
Springer
15 years 4 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