749 search results - page 59 / 150 » Combinatory Models and Symbolic Computation |
AIPS
2007
14 years 8 days ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
CCS
2009
ACM
14 years 4 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
AAAI
2008
14 years 8 days ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
CONCUR
2003
Springer
14 years 3 months ago
2003
Springer
Multi-valued model-checking is an extension of classical model-checking to reasoning about systems with uncertain information, which are common during early design stages. The addi...
FOCM
2011
13 years 4 months ago
2011
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...