4255 search results - page 767 / 851 » On Learning Boolean Functions |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
This demonstration illustrates how a comprehensive database reconciliation tool can provide the ability to characterize data-quality and data-reconciliation issues in complex real...
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
ICPR
2010
IEEE
13 years 10 months ago
2010
IEEE
—A novel non-linear dimensionality reduction method, called Temporal Laplacian Eigenmaps, is introduced to process efficiently time series data. In this embedded-based approach,...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...