3172 search results - page 500 / 635 » On the Random-Self-Reducibility of Complete Sets |
172
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
163
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
174
click to vote
CONCUR
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
153
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
186
click to vote
CONTEXT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many environments in which people and computer agents interact involve deploying resources to accomplish tasks and satisfy goals. This paper investigates the way that the...