Sciweavers

730 search results - page 36 / 146
» Combinatorics of Monotone Computations
Sort
View
COCOON
2009
Springer
14 years 3 months ago
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
14 years 29 days ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 9 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
CIKM
2005
Springer
14 years 2 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima
ICDCS
2002
IEEE
14 years 1 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir