Sciweavers

1381 search results - page 76 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
115
Voted
SAC
2006
ACM
15 years 10 months ago
Post-partition reconciliation protocols for maintaining consistency
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...
Mikael Asplund, Simin Nadjm-Tehrani
124
Voted
SPIN
2005
Springer
15 years 9 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
ECCV
2004
Springer
15 years 9 months ago
Combining Simple Models to Approximate Complex Dynamics
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
Leonid Taycher, John W. Fisher III, Trevor Darrell
125
Voted
FOCS
2009
IEEE
15 years 10 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 4 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal