1101 search results - page 176 / 221 » Comparing Computer Models Solving Number Series Problems |
HM
2007
Springer
15 years 3 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
116
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
BMVC
2010
14 years 7 months ago
2010
Given a video and associated text, we propose an automatic annotation scheme in which we employ a latent topic model to generate topic distributions from weighted text and then mo...
82
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...