Sciweavers

18090 search results - page 22 / 3618
» Computing by Only Observing
Sort
View
ITICSE
2003
ACM
14 years 1 months 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
AAAI
1997
13 years 9 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
BMCBI
2011
13 years 2 days ago
Computable visually observed phenotype ontological framework for plants
Background: The ability to search for and precisely compare similar phenotypic appearances within and across species has vast potential in plant science and genetic research. The ...
Jaturon Harnsomburana, Jason M. Green, Adrian S. B...
DAC
1998
ACM
14 years 21 days 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
INFORMATICALT
2010
134views more  INFORMATICALT 2010»
13 years 5 months ago
Observability of Turing Machines: A Refinement of the Theory of Computation
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
Yaroslav D. Sergeyev, Alfredo Garro