3729 search results - page 692 / 746 » On Formal Modeling of Agent Computations |
175
click to vote
ICALP
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
150
click to vote
ICDT
2007
ACM
16 years 6 days ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
149
click to vote
ICRA
2006
IEEE
16 years 2 days ago
2006
IEEE
This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
186
click to vote
ICNP
2005
IEEE
15 years 11 months ago
2005
IEEE
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
167
click to vote
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...