1753 search results - page 108 / 351 » Reducibility of domain representations and Cantor-Weihrauch ... |
AIPS
2008
13 years 11 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
JSW
2008
13 years 9 months ago
2008
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
SERP
2003
13 years 10 months ago
2003
In the face of extensive attention form both the research community and the industry, traceability there still lacks of a supporting methodology that enables traceability througho...
AAAI
1994
13 years 10 months ago
1994
Most Artificial Intelligence programs lack generality because they reason with a single domain theory that is tailored for a specific task and embodies a host of implicit assumpti...
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
The objective of active recognition is to iteratively collect the next "best" measurements (e.g., camera angles or viewpoints), to maximally reduce ambiguities in recogn...