454 search results - page 85 / 91 » On improving approximate solutions by evolutionary algorithm... |
120
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
105
click to vote
CSDA
2008
14 years 11 months ago
2008
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
88
Voted
EOR
2006
14 years 11 months ago
2006
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
EOR
2007
14 years 11 months ago
2007
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
JGO
2010
14 years 6 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...