Sciweavers

8780 search results - page 169 / 1756
» On the Feasibility of Consistent Computations
Sort
View
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
15 years 11 months ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
16 years 1 months ago
Improved worst-case response-time calculations by upper-bound conditions
Fast real-time feasibility tests and analysis algorithms are necessary for a high acceptance of the formal techniques by industrial software engineers. This paper presents a possi...
Victor Pollex, Steffen Kollmann, Karsten Albers, F...
160
Voted
CSFW
2007
IEEE
16 years 1 months ago
A Formal Theory of Key Conjuring
Key conjuring is the process by which an attacker obtains an unknown, encrypted key by repeatedly calling a cryptographic API function with random values in place of keys. We prop...
Véronique Cortier, Stéphanie Delaune...
ISNN
2005
Springer
16 years 18 days ago
Multiple Parameter Selection for LS-SVM Using Smooth Leave-One-Out Error
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number ...
Liefeng Bo, Ling Wang, Licheng Jiao
264
Voted
ICAISC
2004
Springer
16 years 15 days ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak