6584 search results - page 1084 / 1317 » Distributed Shared Contexts |
142
click to vote
SIROCCO
2004
15 years 5 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
162
click to vote
AAAI
1994
15 years 5 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
146
click to vote
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Idle desktops have been successfully used to run sequential and master-slave task parallel codes on a large scale in the context of volunteer computing. However, execution of messa...
137
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...