Sciweavers

724 search results - page 89 / 145
» Some Structural Complexity Aspects of Neural Computation
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
SI3D
2005
ACM
15 years 3 months ago
Texture sprites: texture elements splatted on surfaces
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
ICDM2
2004
Springer
196views Data Mining» more  ICDM2 2004»
15 years 3 months ago
An Early Warning System for Vehicle Related Quality Data
Vehicle production audit tests, warranty claims and car control unit data are stored in a central data warehouse for data mining analysis. Neural network based part failure rate es...
Matthias Grabert, Markus Prechtel, Tomas Hrycej, W...
ESANN
2008
14 years 11 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
JSA
2000
175views more  JSA 2000»
14 years 9 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd