4208 search results - page 248 / 842 » Challenges in Evaluating Distributed Algorithms |
163
click to vote
APVIS
2007
15 years 8 months ago
2007
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
170
click to vote
P2P
2009
IEEE
16 years 1 months ago
2009
IEEE
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unf...
190
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
178
Voted
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
196
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...