Search Sciweavers | Sciweavers

18

FUIN
2006

90views more FUIN 2006»

Local Computations in Graphs: The Case of Cellular Edge Local Computations

13 years 5 months ago

We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...

Jérémie Chalopin, Yves Métivi...

claim paper

Read More »

21

click to vote

HPCA
2012
IEEE

252views Distributed And Parallel Com...» more HPCA 2012»

Staged Reads: Mitigating the impact of DRAM writes on DRAM reads

12 years 1 months ago

Download www.hpl.hp.com

Main memory latencies have always been a concern for system performance. Given that reads are on the critical path for CPU progress, reads must be prioritized over writes. However...

Niladrish Chatterjee, Naveen Muralimanohar, Rajeev...

claim paper

Read More »

7

click to vote

TACAS
2009
Springer

134views Algorithms» more TACAS 2009»

Computing Weakest Strategies for Safety Games of Imperfect Information

14 years 16 days ago

Download eprints.eemcs.utwente.nl

CEDAR (Counter Example Driven Antichain Reﬁnement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...

Wouter Kuijper, Jaco van de Pol

claim paper

Read More »

19

click to vote

IJCAI
2001

125views Artificial Intelligence» more IJCAI 2001»

Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas

13 years 7 months ago

Download cs.nyu.edu

A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...

Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...

claim paper

Read More »

13

click to vote

PODC
2004
ACM

85views Distributed And Parallel Com...» more PODC 2004»

The weakest failure detectors to solve certain fundamental problems in distributed computing

13 years 11 months ago