2016 search results - page 358 / 404 » Megamaps: Construction and Examples |
ISPAN
2002
IEEE
14 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
ISSRE
2002
IEEE
14 years 2 months ago
2002
IEEE
Software Fault Tree Analysis (SFTA) provides a structured way to reason about the safety or reliability of a software system. As such, SFTA is widely used in missioncritical appli...
APN
2010
Springer
14 years 2 months ago
2010
Springer
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
EUROCRYPT
2010
Springer
14 years 2 months ago
2010
Springer
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...