Sciweavers

4095 search results - page 206 / 819
» How to test a tree
Sort
View
92
Voted
AAAI
2012
13 years 2 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 7 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
132
Voted
PE
2010
Springer
175views Optimization» more  PE 2010»
14 years 7 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
LICS
2008
IEEE
15 years 6 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
SIGCSE
2006
ACM
139views Education» more  SIGCSE 2006»
15 years 6 months ago
Closing the loop on test creation: a question assessment mechanism for instructors
New accreditation requirements focus on education as a “continuous improvement process.” The most important part of such a process is that information gets fed back into the s...
Titus Winters, Tom Payne