5981 search results - page 345 / 1197 » time 2006 |
171
click to vote
CATS
2006
15 years 8 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
149
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
Off-line rendering techniques have nowadays reached an astonishing level of realism but pay the cost of long computational times. The new generation of programmable graphic hardwa...
168
click to vote
HEURISTICS
2007
15 years 6 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
145
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
137
Voted
AIIDE
2006
15 years 8 months ago
2006
To save precious time and space, many games and simulations use static terrain and fixed (or random) reconstruction of areas that a player leaves and later revisits. This can resu...