Sciweavers

8094 search results - page 58 / 1619
» Improvements in Formula Generalization
Sort
View
FROCOS
2009
Springer
14 years 3 months ago
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
Stéphane Lescuyer, Sylvain Conchon
AAAI
1994
13 years 10 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
ICC
2009
IEEE
143views Communications» more  ICC 2009»
13 years 6 months ago
Throughput Improvement through Precoding in OFDMA Systems with Limited Feedback
In this paper, we study the possibility of throughput improvement through precoding in OFDMA based wireless systems with limited channel feedback. Precoding can increase the overal...
Sameh Sorour, Amin Alamdar Yazdi, Shahrokh Valaee,...
EJC
2007
13 years 9 months ago
On the sign-imbalance of skew partition shapes
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is ...
Jonas Sjöstrand
SIGSOFT
2005
ACM
14 years 9 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson