A combinatorial error bound for t-point-based sampling

Author： Dukes P.   Ling A.C.H.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 479-488

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Interval Branch and Bound with Local Sampling for Constrained Global Optimization

By Sun M.   Johnson A.W.  

Journal of Global Optimization, Vol. 33, Iss. 1, 2005-09 ,pp. : 61-82

Springer Publishing Company

Access to resources Recommend Favorite

Reactant- and product-based approaches to the design of combinatorial libraries

By Gillet V.J.  

Journal of Computer-Aided Molecular Design, Vol. 16, Iss. 5-6, 2002-05 ,pp. : 371-380

Springer Publishing Company

Access to resources Recommend Favorite

Model-Based Search for Combinatorial Optimization: A Critical Survey

By Zlochin Mark  

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 373-395

Springer Publishing Company

Access to resources Recommend Favorite

Worst Case and a Distribution-Based Case Analyses of Sampling for Rule Discovery Based on Generality and Accuracy: Special Issue: Foundations and Advances in Data Mining (Guest Editors: Wesley Chu and T.Y. Lin)

By Suzuki Einoshin  

Applied Intelligence, Vol. 22, Iss. 1, 2005-01 ,pp. : 29-36

Springer Publishing Company

Access to resources Recommend Favorite

Improving Sampling‐based Motion Control

By  

COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol. 34, Iss. 2, 2015-05 ,pp. : 415-423

John Wiley & Sons Inc

Access to resources Recommend Favorite