Sciweavers

4306 search results - page 44 / 862
» Timed Testing with TorX
Sort
View
CCS
1998
ACM
13 years 12 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
RT
2000
Springer
13 years 11 months ago
Real-Time Rendering of Densely Populated Urban Environments
Abstract. In this paper we present some preliminary results concerning a realtime visualisation system for densely populated urban environments. In order to be able to render the l...
Franco Tecchia, Yiorgos Chrysanthou
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
13 years 11 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 5 months ago
Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
Irina Lupu, Pierre Courbin, Laurent George, Jo&eum...
SBCCI
2004
ACM
117views VLSI» more  SBCCI 2004»
14 years 1 months ago
Reducing test time with processor reuse in network-on-chip based systems
This paper proposes a test planning method capable of reusing available processors as test sources and sinks, and the on-chip network as the access mechanism for the test of cores...
Alexandre M. Amory, Érika F. Cota, Marcelo ...