5675 search results - page 189 / 1135 » Exploiting Chaos for Computation |
157
Voted
DFN
2004
15 years 6 months ago
2004
: In this paper we propose a Grid Workflow Infrastructure, which serves as the base for specifying and executing collaborative interactive workflows within computational grids. The...
136
click to vote
FLAIRS
2004
15 years 6 months ago
2004
In human-human conversation, people use linguistic expressions that are flexibly tailored to context as a matter of course, and they expect their conversational partners to do lik...
144
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 6 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
155
click to vote
AIPS
2009
15 years 5 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
120
click to vote
AUTOMATICA
2007
15 years 4 months ago
2007
We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The pr...