Sciweavers

40 search results - page 7 / 8
» Runtime analysis of binary PSO
Sort
View
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
SP
2010
IEEE
194views Security Privacy» more  SP 2010»
13 years 11 months ago
Identifying Dormant Functionality in Malware Programs
—To handle the growing flood of malware, security vendors and analysts rely on tools that automatically identify and analyze malicious code. Current systems for automated malwar...
Paolo Milani Comparetti, Guido Salvaneschi, Engin ...
CASES
2006
ACM
14 years 1 months ago
A dynamic code placement technique for scratchpad memory using postpass optimization
In this paper, we propose a fully automatic dynamic scratchpad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on deman...
Bernhard Egger, Chihun Kim, Choonki Jang, Yoonsung...
CAV
2006
Springer
132views Hardware» more  CAV 2006»
13 years 11 months ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
JMLR
2002
144views more  JMLR 2002»
13 years 7 months ago
Round Robin Classification
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
Johannes Fürnkranz