Sciweavers

1971 search results - page 229 / 395
» Tabu search - Uncharted domains
Sort
View
ML
2000
ACM
150views Machine Learning» more  ML 2000»
15 years 6 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
SIGKDD
2000
106views more  SIGKDD 2000»
15 years 6 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
AIEDAM
1998
87views more  AIEDAM 1998»
15 years 6 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
PR
2007
129views more  PR 2007»
15 years 6 months ago
EROS: Ensemble rough subspaces
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...
Qinghua Hu, Daren Yu, Zongxia Xie, Xiaodong Li
CORR
2010
Springer
427views Education» more  CORR 2010»
15 years 4 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg