13603 search results - page 321 / 2721 » On the Computational Complexity of Cut-Reduction |
188
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Robots that can interact naturally with humans require the integration and coordination of many different components with heavy computational demands. We argue that an architec...
179
click to vote
CSCWD
2001
Springer
15 years 12 months ago
2001
Springer
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
167
click to vote
GI
2005
Springer
16 years 29 days ago
2005
Springer
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
203
Voted
FOCS
2003
IEEE
16 years 22 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...