4075 search results - page 386 / 815 » Modeling Distributed Algorithm Using B |
194
click to vote
DIALM
2010
ACM
15 years 4 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
179
click to vote
CSB
2003
IEEE
16 years 3 days ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
161
click to vote
WECWIS
2005
IEEE
16 years 12 days ago
2005
IEEE
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
164
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
279
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal...