Sciweavers

7978 search results - page 86 / 1596
» Combining shared-coin algorithms
Sort
View
CADE
2009
Springer
16 years 6 days ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
15 years 6 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
ICRA
2007
IEEE
148views Robotics» more  ICRA 2007»
15 years 5 months ago
Dynamic Obstacle Avoidance in uncertain environment combining PVOs and Occupancy Grid
— Most of present work for autonomous navigation in dynamic environment doesn’t take into account the dynamics of the obstacles or the limits of the perception system. To face ...
Chiara Fulgenzi, Anne Spalanzani, Christian Laugie...
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
15 years 5 months ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
CEC
2005
IEEE
15 years 5 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...