Sciweavers

504 search results - page 33 / 101
» A Distributed Algorithm for Optimal Concurrent Communication...
Sort
View
SPAA
2005
ACM
14 years 1 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 1 months ago
DXCS: an XCS system for distributed data mining
XCS is a flexible system for data mining due to its ability to deal with environmental changes, learn online with little prior knowledge and evolve accurate and maximally general...
Hai Huong Dam, Hussein A. Abbass, Chris Lokan
SC
1994
ACM
14 years 2 days ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
ICDCN
2010
Springer
14 years 2 months ago
Parallelization of the Lanczos Algorithm on Multi-core Platforms
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Souvik Bhattacherjee, Abhijit Das
EUROSYS
2006
ACM
14 years 5 months ago
The SMART way to migrate replicated stateful services
Many stateful services use the replicated state machine approach for high availability. In this approach, a service runs on multiple machines to survive machine failures. This pap...
Jacob R. Lorch, Atul Adya, William J. Bolosky, Ron...