Sciweavers

2905 search results - page 475 / 581
» Formal Memetic Algorithms
Sort
View
CSFW
2010
IEEE
14 years 1 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
HT
2009
ACM
14 years 1 months ago
Dynamic hypertext generation for reusing open corpus content
Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a prop...
Ben Steichen, Séamus Lawless, Alexander O'C...
FAST
2010
14 years 12 days ago
A Clean-Slate Look at Disk Scrubbing
A number of techniques have been proposed to reduce the risk of data loss in hard-drives, from redundant disks (e.g., RAID systems) to error coding within individual drives. Disk ...
Alina Oprea, Ari Juels
AAAI
2007
14 years 12 days ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
14 years 2 days ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...