Sciweavers

526 search results - page 87 / 106
» Improved Decomposition of STGs
Sort
View
WSCG
2004
156views more  WSCG 2004»
13 years 11 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
NIPS
2003
13 years 11 months ago
Nonlinear Filtering of Electron Micrographs by Means of Support Vector Regression
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...
Roland Vollgraf, Michael Scholz, Ian A. Meinertzha...
FLAIRS
1998
13 years 11 months ago
The Program Analysis Tool for Reuse: Identifying Reusable Components
Software reuse has been demonstrated to increase productivity, reduce costs, and improve software quality. The research that has addressed this problem has concentrated on code cr...
Letha H. Etzkorn, Carl G. Davis, Lisa L. Bowen, Ja...
UAI
1996
13 years 11 months ago
Context-Specific Independence in Bayesian Networks
Bayesiannetworks provide a languagefor qualitatively representing the conditional independence properties of a distribution. This allows a natural and compact representation of th...
Craig Boutilier, Nir Friedman, Moisés Golds...
AIIDE
2009
13 years 11 months ago
Examining Extended Dynamic Scripting in a Tactical Game Framework
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
Jeremy Ludwig, Arthur Farley