Sciweavers

1272 search results - page 209 / 255
» The Set Cover with Pairs Problem
Sort
View
ATAL
2005
Springer
14 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
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 11 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
ICPR
2000
IEEE
14 years 11 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 11 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
SIGMOD
2006
ACM
89views Database» more  SIGMOD 2006»
14 years 10 months ago
Testing database applications
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
Carsten Binnig, Donald Kossmann, Eric Lo