Sciweavers

2944 search results - page 191 / 589
» Improving Bound Propagation
Sort
View
JAIR
2008
120views more  JAIR 2008»
13 years 10 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
MCS
2010
Springer
13 years 9 months ago
MinT - Architecture and applications of the (t, m, s)-net and OOA database
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...
Rudolf Schürer, Wolfgang Ch. Schmid
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 2 months ago
On the Limitations of Provenance for Queries With Difference
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...
Yael Amsterdamer, Daniel Deutch, Val Tannen
ICASSP
2011
IEEE
13 years 2 months ago
Practical codes for lossy compression when side information may be absent
Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TC...
Sivagnanasundaram Ramanan, John MacLaren Walsh
DCC
2005
IEEE
14 years 10 months ago
On Goppa Codes and Weierstrass Gaps at Several Points
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273?290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.
Cícero Carvalho, Fernando Torres