4940 search results - page 143 / 988 » On the Complexity of Universal Programs |
139
Voted
KR
1998
Springer
15 years 9 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
154
click to vote
LICS
1993
IEEE
15 years 9 months ago
1993
IEEE
traction for a Shared Variable Parallel Language Stephen Brookes∗ School of Computer Science Carnegie Mellon University Pittsburgh, Pa 15213 We give a new denotational semantics...
160
click to vote
ECOOP
2012
Springer
13 years 7 months ago
2012
Springer
Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation ov...
217
Voted
CVPR
2009
IEEE
17 years 4 days ago
2009
IEEE
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
163
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...