Sciweavers

11371 search results - page 1943 / 2275
» The network inhibition problem
Sort
View
IWANN
1999
Springer
15 years 11 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
WAN
1998
Springer
15 years 11 months ago
The NRW Metacomputing Initiative
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...
Uwe Schwiegelshohn, Ramin Yahyapour
PERCOM
2010
ACM
15 years 10 months ago
Tuning to your position: FM radio based indoor localization with spontaneous recalibration
—Position of mobile users has become highly important information in pervasive computing environments. Indoor localization systems based on Wi-Fi signal strength fingerprinting t...
Aleksandar Matic, Andrei Papliatseyeu, Venet Osman...
DSN
2004
IEEE
15 years 10 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
DSN
2006
IEEE
15 years 10 months ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve
« Prev « First page 1943 / 2275 Last » Next »