Sciweavers

16430 search results - page 440 / 3286
» On Computable Tree Functions
Sort
View
NIPS
1993
15 years 8 months ago
Temporal Difference Learning of Position Evaluation in the Game of Go
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
EJC
2008
15 years 7 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
JCP
2008
162views more  JCP 2008»
15 years 6 months ago
Shape Recognition by Clustering and Matching of Skeletons
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
Hamidreza Zaboli, Mohammad Rahmati, Abdolreza Mirz...
TOG
2010
118views more  TOG 2010»
15 years 1 months ago
A hierarchical volumetric shadow algorithm for single scattering
Volumetric effects such as beams of light through participating media are an important component in the appearance of the natural world. Many such effects can be faithfully modele...
Ilya Baran, Jiawen Chen, Jonathan Ragan-Kelley, Fr...
AAAI
2004
15 years 8 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam