11716 search results - page 168 / 2344 » Computable symbolic dynamics |
173
click to vote
IVC
2008
15 years 6 months ago
2008
This paper considers arguments for the necessity of embodiment in cognitive vision systems. We begin by delineating the scope of cognitive vision, and follow this by a survey of t...
164
click to vote
PLDI
2010
ACM
16 years 3 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
166
click to vote
RTCSA
2007
IEEE
16 years 22 days ago
2007
IEEE
MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and co...
176
click to vote
SIAMREV
2010
15 years 1 months ago
2010
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
153
click to vote
CCS
2009
ACM
16 years 1 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...