2924 search results - page 114 / 585 » Lower Bounds in Distributed Computing |
82
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
103
Voted
NIPS
1998
15 years 2 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
109
click to vote
FCCM
2000
IEEE
15 years 5 months ago
2000
IEEE
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
96
Voted
HIPC
2004
Springer
15 years 6 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
105
Voted
SPAA
1995
ACM
15 years 4 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...