5448 search results - page 803 / 1090 » Breakpoints and Time in Distributed Computations |
171
click to vote
UAI
1996
15 years 8 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
338
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
165
click to vote
JPDC
2008
15 years 6 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
167
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
179
click to vote
SIAMSC
2010
15 years 5 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...