Sciweavers

1369 search results - page 152 / 274
» A Practical Implementation of the Timing Attack
Sort
View
FPL
2004
Springer
115views Hardware» more  FPL 2004»
15 years 2 months ago
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
Ali Ahmadinia, Christophe Bobda, Sándor P. ...
AC
2005
Springer
14 years 11 months ago
Software model checking with SPIN
The aim of this chapter is to give an overview of the theoretical foundation and the practical application of logic model checking techniques for the verification of multi-threade...
Gerard J. Holzmann
JAR
2000
137views more  JAR 2000»
14 years 11 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
IFIP
2010
Springer
14 years 6 months ago
Autonomic Approach to Planning and Scheduling in Networked Small Factories
The paper considers the complex behavior of a small company in a business ecosystem, time by time leader or supplier or both in one or more supply chains, and points out the data e...
Flavio Bonfatti, Luca Martinelli, Paola Daniela Mo...
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 2 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica