Sciweavers

5275 search results - page 3 / 1055
» Computing by observing
Sort
View
DAC
1998
ACM
13 years 11 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
ITICSE
2003
ACM
14 years 18 days ago
Observations from using two modes of teaching undergraduate computer architecture
The authors present observations from using two modes of teaching undergraduate computer architecture. Two sections were taught differently: one section was taught using a traditi...
Benjoe A. Juliano, Chi-Hui Chen, Elena Kroumova
CCS
2008
ACM
13 years 9 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
NN
2006
Springer
122views Neural Networks» more  NN 2006»
13 years 7 months ago
Goals and means in action observation: A computational approach
Many of our daily activities are supported by behavioural goals that guide the selection of actions, which allow us to reach these goals effectively. Goals are considered to be im...
Raymond H. Cuijpers, Hein T. van Schie, Mathieu Ko...
AAAI
1997
13 years 8 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht