Sciweavers

284 search results - page 12 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
ISI
2006
Springer
13 years 7 months ago
Cost-Sensitive Access Control for Illegitimate Confidential Access by Insiders
Abstract. In many organizations, it is common to control access to confidential information based on the need-to-know principle; The requests for access are authorized only if the ...
Young-Woo Seo, Katia P. Sycara
SAC
2005
ACM
14 years 1 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
DAC
2003
ACM
14 years 8 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
ORL
1998
137views more  ORL 1998»
13 years 7 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans
GECCO
2009
Springer
14 years 10 days ago
Search based data sensitivity analysis applied to requirement engineering
Software engineering is plagued by problems associated with unreliable cost estimates. This paper introduces an approach to sensitivity analysis for requirements engineering. It u...
Mark Harman, Jens Krinke, Jian Ren, Shin Yoo