1662 search results - page 64 / 333 » The Computational Complexity of Agent Design Problems |
WSCG
2004
13 years 10 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
SPAA
2004
ACM
14 years 2 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
GRID
2000
Springer
14 years 13 days ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
EVOW
2010
Springer
14 years 4 days ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
DIGRA
2005
Springer
14 years 2 months ago
2005
Springer
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...