1547 search results - page 74 / 310 » Randomized Variable Elimination |
167
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
153
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
171
click to vote
CPC
1999
15 years 5 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
166
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
175
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...