Sciweavers

989 search results - page 108 / 198
» Version spaces and the consistency problem
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
15 years 27 days ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
IJCAI
2001
15 years 7 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
ECCC
2008
98views more  ECCC 2008»
15 years 6 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
CVPR
2012
IEEE
13 years 8 months ago
From label fusion to correspondence fusion: A new approach to unbiased groupwise registration
Label fusion strategies are used in multi-atlas image segmentation approaches to compute a consensus segmentation of an image, given a set of candidate segmentations produced by r...
Paul A. Yushkevich, Hongzhi Wang, John Pluta, Bria...
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 6 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...