Search Sciweavers | Sciweavers

6897 search results - page 18 / 1380

» Parallelization of Modular Algorithms

click to vote

STOC
1996
ACM

125views Algorithms» more STOC 1996»

Modular Coloring Formulas Are Hard for Cutting Planes Proofs

14 years 22 days ago

Download www.cs.helsinki.fi

Xudong Fu

claim paper

Read More »

click to vote

CONCUR
2010
Springer

190views Distributed And Parallel Com...» more CONCUR 2010»

Reasoning about Optimistic Concurrency Using a Program Logic for History

13 years 9 months ago

Download flint.cs.yale.edu

Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...

Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang

claim paper

Read More »

click to vote

AAAI
2012

196views Intelligent Agents» more AAAI 2012»

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters

11 years 11 months ago

Download metahack.org

Alex Fukunaga, Akihiro Kishimoto, Adi Botea

claim paper

Read More »

click to vote

SWAT
2004
Springer

123views Algorithms» more SWAT 2004»

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

14 years 1 months ago

Download www.liafa.jussieu.fr

The ﬁrst polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...

Michel Habib, Fabien de Montgolfier, Christophe Pa...

claim paper

Read More »

click to vote

HPCS
2006
IEEE

98views Distributed And Parallel Com...» more HPCS 2006»

A Component-Based Approach to Improving the Modularity of OSCAR

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers