Sciweavers

2747 search results - page 31 / 550
» Non-oblivious Strategy Improvement
Sort
View
CCS
2004
ACM
15 years 3 months ago
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applic...
Adam J. O'Donnell, Harish Sethu
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
15 years 2 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last
ICDAR
2009
IEEE
15 years 5 months ago
Rejection Strategies with Multiple Classifiers for Handwritten Character Recognition
With rejection strategies in a handwriting recognition system, we are able to improve the reliability and accuracy of the recognized characters. In this paper, we propose several ...
Xu-Cheng Yin, Hong-Wei Hao, Yun-Feng Tang, Jun Sun...
ENTER
2009
Springer
15 years 5 months ago
Learning Adaptive Recommendation Strategies for Online Travel Planning
Conversational recommender systems support human-computer interaction strategies in order to assist online tourists in the important activity of dynamic packaging, i.e., in buildi...
Tariq Mahmood, Francesco Ricci, Adriano Venturini
APWEB
2003
Springer
15 years 3 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...