1329 search results - page 215 / 266 » Randomly Sampling Molecules |
NAA
2000
Springer
14 years 17 days ago
2000
Springer
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
STOC
1995
ACM
14 years 16 days ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
AICCSA
2008
IEEE
13 years 11 months ago
2008
IEEE
Time Series are ubiquitous, hence, similarity search is one of the biggest challenges in the area of mining time series data. This is due to the vast data size, number of sequence...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
ISQED
2010
IEEE
13 years 11 months ago
2010
IEEE
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...