967 search results - page 160 / 194 » On the efficiency of adaptive MCMC algorithms |
KDD
2004
ACM
16 years 5 days ago
2004
ACM
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
116
click to vote
ICCBR
2009
Springer
14 years 9 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
107
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
CC
2002
Springer
14 years 11 months ago
2002
Springer
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block...