29908 search results - page 264 / 5982 » On the Complexity of |
218
click to vote
LCC
1994
15 years 10 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
188
click to vote
SIGAL
1990
15 years 10 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
206
click to vote
CGO
2004
IEEE
15 years 10 months ago
2004
IEEE
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
129
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Sawtooth (2009) is an artwork integrating performance, sound, and animation. This paper describes the design of Sawtooth, with particular reference to the balances it strikes betw...
138
click to vote
AAAI
2007
15 years 9 months ago
2007
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...