Sciweavers

414 search results - page 12 / 83
» Commitment to Correlated Strategies
Sort
View
ACSAC
2004
IEEE
13 years 11 months ago
Attack Plan Recognition and Prediction Using Causal Networks
Correlating and analyzing security alerts is a critical and challenging task in security management. Recently, some techniques have been proposed for security alert correlation. H...
Xinzhou Qin, Wenke Lee
ICMLA
2004
13 years 9 months ago
A new landmarker generation algorithm based on correlativity
Landmarking is a recent and promising metalearning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is m...
Daren Ler, Irena Koprinska, Sanjay Chawla
ATAL
2008
Springer
13 years 10 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 4 months ago
On extracting common random bits from correlated sources
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
Andrej Bogdanov, Elchanan Mossel
IJCAI
2003
13 years 9 months ago
Increasing Dialogue Efficiency in Case-Based Reasoning Without Loss of Solution Quality
Increasing dialogue efficiency in case-based reasoning (CBR) must be balanced against the risk of commitment to a sub-optimal solution. Focusing on incremental query elicitation i...
David McSherry