Sciweavers

1088 search results - page 144 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
WG
2007
Springer
15 years 5 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
CLUSTER
2004
IEEE
15 years 2 months ago
Simplifying administration through dynamic reconfiguration. in a cooperative cluster storage system
Cluster Storage Systems where storage devices are distributed across a large number of nodes are able to reduce the I/O bottleneck problems present in most centralized storage sys...
Renaud Lachaize, Jorgen S. Hansen
EDO
2000
Springer
15 years 2 months ago
Distributed Proxy: A Design Pattern for the Incremental Development of Distributed Applications
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...
António Rito Silva, Francisco Assis Rosa, T...
DCC
2011
IEEE
14 years 6 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
CHI
2009
ACM
15 years 11 months ago
Associative personal information management
Personal information management (PIM) is an important and hard research problem. Previous systems suffer inflexibility because of strict hierarchies and immobility. I present an a...
Jonathan Diehl