Sciweavers

503 search results - page 16 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
NSPW
2004
ACM
15 years 3 months ago
Property-based attestation for computing platforms: caring about properties, not mechanisms
Over the past years, the computing industry has started various initiatives announced to increase computer security by means of new hardware architectures. The most notable effort...
Ahmad-Reza Sadeghi, Christian Stüble
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 7 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
APLAS
2005
ACM
15 years 3 months ago
Calculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
Hugh Anderson, Siau-Cheng Khoo, Stefan Andrei, Bea...
IJCAI
2001
14 years 11 months ago
Dynamic Control Of Plans With Temporal Uncertainty
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...
Paul H. Morris, Nicola Muscettola, Thierry Vidal
92
Voted
NIPS
2007
14 years 11 months ago
Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
Emre Neftci, Elisabetta Chicca, Giacomo Indiveri, ...