395 search results - page 46 / 79 » Polynomial Approximations for Model Checking |
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
One of the main research concern in neural networks is to find the appropriate network size in order to minimize the trade-off between overfitting and poor approximation. In this ...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
The recent ability to measure quickly and inexpensively dense sets of points on physical objects has deeply influenced the way engineers used to represent shapes in CAD systems, ...
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
ICTAC
2009
Springer
14 years 7 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...