Sciweavers

736 search results - page 96 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
JAPLL
2010
133views more  JAPLL 2010»
13 years 7 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
LATINCRYPT
2010
13 years 7 months ago
Accelerating Lattice Reduction with FPGAs
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
Jérémie Detrey, Guillaume Hanrot, Xa...
FORMATS
2010
Springer
13 years 6 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
CORR
2010
Springer
39views Education» more  CORR 2010»
13 years 6 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty
ICASSP
2011
IEEE
13 years 13 days ago
Efficient lattice-reduction-aided MMSE decision-feedback equalization
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
Robert F. H. Fischer