Sciweavers

370 search results - page 28 / 74
» Bounded modified realizability
Sort
View
RTAS
2010
IEEE
13 years 7 months ago
Selecting Server Parameters for Predictable Runtime Monitoring
—Application of runtime monitoring to maintain the health of an embedded real-time software system requires that anomalous behavior be detected within a bounded time while preser...
Haitao Zhu, Steve Goddard, Matthew B. Dwyer
ICS
2010
Tsinghua U.
14 years 6 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 21 days ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
TCOM
2008
119views more  TCOM 2008»
13 years 8 months ago
Maximum likelihood detection for differential unitary space-time modulation with carrier frequency offset
Can conventional differential unitary space time modulation (DUSTM) be applied when there is an unknown carrier frequency offset (CFO)? This paper answers this question affirmative...
Feifei Gao, Tao Cui, Arumugam Nallanathan, Chintha...
FMCAD
2007
Springer
14 years 2 months ago
Modeling Time-Triggered Protocols and Verifying Their Real-Time Schedules
Time-triggered systems are distributed systems in which the nodes are independently-clocked but maintain synchrony with one another. Time-triggered protocols depend on the synchro...
Lee Pike