A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Acceleration of SAT-Based Iterative Property Checking
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we propose a new approach to speed up SAT-based iterative property checking. ...
This process can be exploited by reusing conflict clauses in the corresponding SAT instances of consecutive property checking problems. ...
In the last column the achieved speed-up is shown. As can be seen for the 100 cell arbiter in case of the property mutualexclusion no speed-up results. ...
doi:10.1007/11560548_29
fatcat:47i7jxfp5jdu7hn3igph2legau
ManySAT: a Parallel SAT Solver
2009
Journal on Satisfiability, Boolean Modeling and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. ...
Experiments on many industrial SAT instances, and the first rank obtained by ManySAT in the parallel track of the 2008 SAT-Race clearly show the potential of our design philosophy. ...
SAT-Race 2008: parallel solvers against the best sequential solver (Minisat 2.1)
ManySAT pMinisat MiraXT
Average speed-up
6.02
3.10
1.83
by SAT/UNSAT
8.84 /3.14
4.00/2.18
1.85/1.81
Minimal speed-up ...
doi:10.3233/sat190070
fatcat:bjo4ekpfm5auxgtj2vj5kj7bmy
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
CL-SDSAT (time in s) Adding learning to the partition tree approach gives clear speed-up and solves more instances (left fig.) ...
Many modern parallel SAT solvers are based on having several algorithms compete on solving the same instance. ...
Iterative partitioning is an approach based on search space splitting which solves hard SAT instances, and Does not suffer from the increased expected run time problem Is faster than a comparable, efficient ...
doi:10.1007/978-3-642-23786-7_30
fatcat:zgsdchstcbdglhg5unxswbamhu
Efficient MUS extraction with resolution
2013
2013 Formal Methods in Computer-Aided Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
First, we demonstrate how to apply techniques used in the past to speed up resolution-based Group MUS extraction to plain MUS extraction. ...
Second, we show that model rotation, presented in the context of assumption-based MUS extraction, can also be used with resolution-based MUS extraction. ...
CONCLUSION We proposed a number of algorithms for speeding up MUS extraction. First, we adapted GMUS-oriented MUSbiased search algorithms to plain MUS extraction. ...
doi:10.1109/fmcad.2013.6679410
fatcat:ckypgbyqvvhr7bbwjel5j2gvpe
Tuning the speed-accuracy trade-off to maximize reward rate in multisensory decision-making
2015
eLife
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we show that deviations from the optimal speed/accuracy trade-off can be explained by assuming an incomplete gradient-based learning of these trade-offs. ...
For decisions made under time pressure, effective decision making based on uncertain or ambiguous evidence requires efficient accumulation of evidence over time, as well as appropriately balancing speed ...
that were adjusted to best explain the subjects' behavior. 101 In this follow-up study, we use the previously devised model to analyze 102 whether and how effectively human subjects adjust their SAT if ...
doi:10.7554/elife.06678
pmid:26090907
pmcid:PMC4487075
fatcat:5pzpjzj37jhbtbfoi65jeixwz4
Beyond decision! Motor contribution to speed–accuracy trade-off in decision-making
2016
Psychonomic Bulletin & Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Pointing to a speed-accuracy exchange within motor processes themselves, the present results call for a re-evaluation of widely accepted assumptions about SAT, and more generally, decision-making processes ...
The present data challenges this largely accepted view, by directly showing that motor processes are speeded up under time pressure. ...
As a consequence, SAT also occurs within the motor execution level, contributing to the global tradeoff both in terms of chronometry and of error rate, as speeding up motor execution increases the number ...
doi:10.3758/s13423-016-1172-9
pmid:27757924
fatcat:sflhpyapnnbzzmuwb75d7ymqqq
Intra-National, Intra-Continental, and Intra-Planetary PPP
1998
Social Science Research Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
(3) Are speeds of adjustment toward PPP different for intra-national, cross-national and cross-continental real exchange rates? ...
For example, can things be modeled so that our tests do not depend on the "base country"? (2) How should we handle correlation across real exchange rates in panel tests of PPP? ...
Note that, using the assumptions already made, this assumption implies
, each of the rows of this matrix is defined only up to a constant of proportionality. ...
doi:10.2139/ssrn.76928
fatcat:gzx6d3xkuncypism37y7muzo4a
A Comprehensive Analytical Mathematic Model for Permanent-Magnet Synchronous Machines Incorporating Structural and Saturation Saliencies
2010
IEEE transactions on magnetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two parameters are defined to indicate these saliencies, i.e. the structural saliency ratio (K str ) and the saturation saliency ratio (K sat ). ...
Then the inductance matrix in stationary frame can be rewritten as a function of K sat , which can be determined by the current value based on the look up table shown in Table I . ...
The errors of the speed and current mainly come from the friction coefficient of the model and the assumptions made in the proposed mathematic model.
VII. ...
doi:10.1109/tmag.2010.2071392
fatcat:p4ox7ifdtbgr3azgb5uzgytuea
Sub-Optimal Allocation of Time in Sequential Movements
2009
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on our results, we developed and tested a model of speed-accuracy tradeoff for sequential movements. ...
We consider this point where we report results of tests of the assumption. Estimating speed-accuracy tradeoff (SAT). ...
Accordingly, we modeled the SAT based on Schmidt et al. ...
doi:10.1371/journal.pone.0008228
pmid:20011047
pmcid:PMC2785430
fatcat:pt6whjngwvgz3hntmqcwdtce2y
Intranational, Intracontinental, and Intraplanetary PPP
1997
Journal of the Japanese and international economies (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
A model of adjustment toward PPP for a panel of real exchange rates is introduced that allows varying speeds of convergence within nations, within continents and across continents. ...
Of course, each of the rows of this matrix is defined only up to a constant of proportionality. ...
Note that, using the assumptions already made, this assumption implies ͳ 27 ϭ ͳ 28 ϭ ͳ 71 ϭ ͳ 81 ϭ ͳ 72 ϭ ͳ 82 . ͳ 35 ϭ ͳ 36 : The speed of adjustment for Canadian city A toward each of the two German ...
doi:10.1006/jjie.1997.0388
fatcat:tip3r344wrh6jfkbwlzfhtcibm
Superlinear Lower Bounds Based on ETH
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We are especially grateful to Kenneth Regan and Jonathan Buss who shared a manuscript [9] on speed-up results relating time and space. ...
The third speed-up theorem follows by carefully applying the first speed-up theorem. Theorem 16 (Third Speed-up Theorem). ...
The second speed-up theorem follows by combining the first speed-up theorem with the padding lemma. ...
arXiv:2008.06805v5
fatcat:nj6uovce4zetzdxoc5uhmeudhq
Every Little Bit Counts: The Impact of High-speed Internet on the Transition to College
2015
Finance and Economics Discussion Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We link the diffusion of zip code-level residential broadband Internet to millions of PSAT and SAT takers' college testing and application outcomes and find that students with access to high-speed Internet ...
in their junior year of high school perform better on the SAT and apply to a higher number and more expansive set of colleges. ...
High-speed Internet subscriptions are not free, and there are large observable differences in high-speed Internet take-up by education and income. ...
doi:10.17016/feds.2015.108
fatcat:7mdnb2x4wnh7vobvrhjxgdfrr4
Critical examination of constraints on the equation of state of dense matter obtained from GW170817
2018
Physical Review C
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our models are constrained by calculations of the neutron-matter EOS using chiral effective field theory Hamiltonians with reliable error estimates up to once or twice the nuclear saturation density. ...
distinct extrapolations to higher density: a minimal model (MM) which assumes that the EOS is a smooth function of density described by a Taylor expansion and a more general model parametrized by the speed ...
Thus, we base all our models on the neutron-matter EOS up to n tr , which we vary to be n sat or 2n sat . ...
doi:10.1103/physrevc.98.045804
fatcat:c3enmpxi2ngajoe6dx2z5p4v5e
Using unsatisfiable cores to debug multiple design errors
2008
Proceedings of the 18th ACM Great Lakes symposium on VLSI - GLSVLSI '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In comparison to standard SAT-based debugging, the experimental results show a significant speed-up for debugging multiple faults. ...
Unsatisfiable cores contained in a SAT instance for debugging are used (1) to determine all suspects, and (2) to speed-up the debugging process. ...
Due to this reduction speed-ups of up to 2.83 of the total diagnosis run time were achieved. ...
doi:10.1145/1366110.1366131
dblp:conf/glvlsi/SulflowFBD08
fatcat:aoi4zb7nzbcajggstdoosy5lai
Evaluating Las Vegas Algorithms - Pitfalls and Remedies
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We exemplify our approach by applying it to Stochastic Local Search (SLS) algorithms for the satisfiability problem (SAT) in propositional logic. ...
In this paper we propose a novel methodology for evaluating the performance of LVAs, based on the identification of empirical run-time distributions. ...
Especially for multi modal cost distributions high speed-ups could be observed. ...
arXiv:1301.7383v1
fatcat:5pm6j2vd6zcyfbwrezh55afd2e
« Previous
Showing results 1 — 15 out of 48,132 results