Sciweavers

265 search results - page 52 / 53
» Context in Artificial Intelligence: I. A Survey of the Liter...
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 28 days ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 6 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
ICFP
2005
ACM
14 years 6 months ago
Continuations from generalized stack inspection
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
Greg Pettyjohn, John Clements, Joe Marshall, Shrir...
SAC
2009
ACM
13 years 11 months ago
Spam decisions on gray e-mail using personalized ontologies
E-mail is one of the most common communication methods among people on the Internet. However, the increase of e-mail misuse/abuse has resulted in an increasing volume of spam e-ma...
Seongwook Youn, Dennis McLeod
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 10 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp