Sciweavers

224 search results - page 40 / 45
» Bounding Learning Time in XCS
Sort
View
EWCBR
2008
Springer
13 years 9 months ago
Forgetting Reinforced Cases
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
Houcine Romdhane, Luc Lamontagne
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 11 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
IUI
2009
ACM
14 years 4 months ago
Detecting and correcting user activity switches: algorithms and interfaces
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
Jianqiang Shen, Jed Irvine, Xinlong Bao, Michael G...
NDSS
2008
IEEE
14 years 1 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
CCS
2003
ACM
14 years 18 days ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis