Sciweavers

360 search results - page 37 / 72
» The Origins of the Translator's Workstation
Sort
View
CAV
2007
Springer
116views Hardware» more  CAV 2007»
14 years 3 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 3 months ago
Applying Logic Synthesis for Speeding Up SAT
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
Niklas Eén, Alan Mishchenko, Niklas Sö...
ISOLA
2004
Springer
14 years 2 months ago
Embedding Finite Automata within regular Expressions
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
ICRA
2003
IEEE
107views Robotics» more  ICRA 2003»
14 years 2 months ago
The haptic scissors: cutting in virtual environments
The “Haptic Scissors” is a device that creates the sensation of cutting in virtual environments. The scissors have two degrees of freedom of motion and force feedback, one for...
Allison M. Okamura, Robert J. Webster III, Jason T...
CP
2001
Springer
14 years 1 months ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
Nikos Mamoulis, Kostas Stergiou