Sciweavers

1205 search results - page 238 / 241
» Program Extraction from Large Proof Developments
Sort
View
ISCA
2009
IEEE
199views Hardware» more  ISCA 2009»
15 years 4 months ago
SigRace: signature-based data race detection
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assiste...
Abdullah Muzahid, Darío Suárez Graci...
103
Voted
ATAL
2005
Springer
15 years 3 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
15 years 2 months ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 4 months ago
Aneka Cloud Application Platform and Its Integration with Windows Azure
Aneka is an Application Platform-as-a-Service (Aneka PaaS) for Cloud Computing. It acts as a framework for building customized applications and deploying them on either public or ...
Yi Wei, Karthik Sukumar, Christian Vecchiola, Dile...
98
Voted
ICALP
2009
Springer
15 years 9 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald