10 search results - page 1 / 2 » Probabilistic analysis of knapsack core algorithms |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
VTS
2002
IEEE
13 years 9 months ago
2002
IEEE
We present a software-based weighted random pattern scheme for testing delay faults in IP cores of programmable SoCs. We describe a method for determining static and transition pr...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...