Sciweavers

3680 search results - page 124 / 736
» cases 2010
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
JTRES
2010
ACM
15 years 6 months ago
WCET driven design space exploration of an object cache
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
Benedikt Huber, Wolfgang Puffitsch, Martin Schoebe...
EOR
2007
85views more  EOR 2007»
15 years 6 months ago
Reject inference, augmentation, and sample selection
Many researchers see the need for reject inference in credit scoring models to come from a sample selection problem whereby a missing variable results in omitted variable bias. Al...
John Banasik, Jonathan Crook
HAIS
2010
Springer
15 years 11 months ago
CBRid4SQL: A CBR Intrusion Detector for SQL Injection Attacks
One of the most serious security threats to recently deployed databases has been the SQL Injection attack. This paper presents an agent specialised in the detection of SQL injectio...
Cristian Pinzón, Álvaro Herrero, Jua...
KR
2010
Springer
15 years 11 months ago
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Vaishak Belle, Gerhard Lakemeyer