1686 search results - page 146 / 338 » Programs as polygraphs: computability and complexity |
119
Voted
ESAW
2007
Springer
15 years 9 months ago
2007
Springer
The ubiquity of our increasingly distributed and complex computing environments have necessitated the development of programming approaches and paradigms that can automatically man...
145
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...
96
Voted
NIPS
2003
15 years 5 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
139
Voted
CASES
2003
ACM
15 years 9 months ago
2003
ACM
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
138
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper, we describe our experience with developing Airshed, a large pollution modeling application, in the Fx programming environment. We demonstrate that high level parall...