Sciweavers

2905 search results - page 432 / 581
» Formal Memetic Algorithms
Sort
View
ICML
1999
IEEE
16 years 4 months ago
Using Reinforcement Learning to Spider the Web Efficiently
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
Jason Rennie, Andrew McCallum
ICML
1996
IEEE
16 years 4 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
ICSE
2009
IEEE-ACM
16 years 4 months ago
Automatically finding patches using genetic programming
Automatic repair of programs has been a longstanding goal in software engineering, yet debugging remains a largely manual process. We introduce a fully automated method for locati...
Westley Weimer, ThanhVu Nguyen, Claire Le Goues, S...
WWW
2009
ACM
16 years 4 months ago
Rated aspect summarization of short comments
Web 2.0 technologies have enabled more and more people to freely comment on different kinds of entities (e.g. sellers, products, services). The large scale of information poses th...
Yue Lu, ChengXiang Zhai, Neel Sundaresan
133
Voted
WWW
2008
ACM
16 years 4 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev