2693 search results - page 154 / 539 » On Computing Complex Navigation Functions |
142
click to vote
CG
1998
Springer
15 years 10 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
190
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
The capability of perceiving the environment is crucial for advancing the level of autonomy and sophistication of (semi)autonomous robotic systems and determines the complexity of ...
135
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
159
click to vote
TLCA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
169
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...