Sciweavers

1960 search results - page 54 / 392
» The Logic of Large Enough
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
SIAMMA
2011
70views more  SIAMMA 2011»
13 years 2 months ago
Global Smooth Solutions of Euler Equations for Van der Waals Gases
We prove global in time existence of solutions of the Euler compressible equations for a Van der Waals gas when the density is small enough in Hm , for m large enough. To do so, w...
Magali Lécureux-Mercier
KR
2004
Springer
14 years 1 months ago
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...
Volker Haarslev, Ralf Möller
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 7 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
SIGACT
2008
103views more  SIGACT 2008»
13 years 7 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke