1335 search results - page 115 / 267 » Exploration of the Robustness of Plans |
119
click to vote
WSCG
2001
15 years 7 months ago
2001
the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simul...
153
click to vote
ANLP
2000
15 years 7 months ago
2000
In natural language generation, different generation tasks often interact with each other in a complex way, which is hard to capture in the pipeline architecture described by Reit...
207
click to vote
DELOS
2000
15 years 7 months ago
2000
: We explore the complex problem of providing searching services across interoperable heterogeneous federated digital library systems with rich structure and content. We discuss sy...
233
click to vote
JAPLL
2006
15 years 6 months ago
2006
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
156
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— Single-query sampling-based motion planners are an efficient class of algorithms widely used today to solve challenging motion planning problems. This paper exposes the common...