Sciweavers

5595 search results - page 694 / 1119
» Comparing Subsumption Optimizations
Sort
View
COMPUTING
2007
103views more  COMPUTING 2007»
15 years 7 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
JAIR
2008
120views more  JAIR 2008»
15 years 7 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
JCM
2008
81views more  JCM 2008»
15 years 7 months ago
An Iterative Algorithm for Joint Symbol Timing Recovery and Equalization of Short Bursts
In this work a joint clock recovery (CR) and equalization scheme for short burst transmissions is presented. The joint optimization performance may be pursued by means of both data...
Pietro Savazzi, Paolo Gamba, Lorenzo Favalli
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 7 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
JCO
2006
83views more  JCO 2006»
15 years 7 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt