31 search results - page 4 / 7 » cg 1998 |
64
Voted
EJC
1998
14 years 11 months ago
1998
For a digraph G = (V, E) let w(Gn ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair (u1, u2, . . . , un) and (v1, v2, . . . , vn) of m...
72
Voted
CG
1998
Springer
15 years 4 months ago
1998
Springer
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...
CG
1998
Springer
14 years 11 months ago
1998
Springer
State of the art multiresolution modeling allows to selectively refine a coarse mesh of an object on the visually important parts. In this way it is possible to render the geomet...
CG
1998
Springer
14 years 11 months ago
1998
Springer
Chemisty faces interesting problems with regard to internet-based information visualization, especially in the context of digital library documents with multimedia components. We ...
68
Voted
CG
1998
Springer
15 years 4 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...