Sciweavers

60 search results - page 4 / 12
» Reasoning About Sequences of Memory States
Sort
View
ICALP
2009
Springer
14 years 6 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
AIPS
2004
13 years 7 months ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann
ATAL
2006
Springer
13 years 10 months ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...
HASKELL
2009
ACM
14 years 20 days ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
CVPR
2006
IEEE
14 years 8 months ago
Gesture Recognition using Hidden Markov Models from Fragmented Observations
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
Ruiduo Yang, Sudeep Sarkar