Sciweavers

2850 search results - page 398 / 570
» On Timed Models and Full Abstraction
Sort
View
DALT
2005
Springer
16 years 4 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
SSD
2005
Springer
188views Database» more  SSD 2005»
16 years 2 days ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
FC
2003
Springer
171views Cryptology» more  FC 2003»
15 years 11 months ago
Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
Abstract. In this paper we describe several fault attacks on the Advanced Encryption Standard (AES). First, using optical/eddy current fault induction attacks as recently publicly ...
Johannes Blömer, Jean-Pierre Seifert
DATE
2010
IEEE
180views Hardware» more  DATE 2010»
15 years 11 months ago
Reliability- and process variation-aware placement for FPGAs
Abstract—Negative bias temperature instability (NBTI) significantly affects nanoscale integrated circuit performance and reliability. The degradation in threshold voltage (Vth) d...
Assem A. M. Bsoul, Naraig Manjikian, Li Shang
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 10 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld