58 search results - page 3 / 12 » cg 2008 |
CG
2008
Springer
13 years 6 months ago
2008
Springer
The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an ...
CG
2008
Springer
13 years 5 months ago
2008
Springer
We introduce an over-sketching interface for feature-preserving surface mesh editing. The user sketches a stroke that is the suggested position of part of a silhouette of the disp...
CG
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
CG
2008
Springer
13 years 6 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
IPL
2008
13 years 4 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...