Sciweavers

8486 search results - page 67 / 1698
» Ordered Enumeration Method
Sort
View
EOR
2006
65views more  EOR 2006»
13 years 7 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
LATINCRYPT
2010
13 years 6 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...
DCC
2011
IEEE
13 years 2 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
IVS
2010
62views more  IVS 2010»
13 years 2 months ago
A survey of multiple tree visualisation
This article summarises the current state of research into multiple tree visualisations. It discusses the spectrum of current representation techniques used on single trees, pairs ...
Martin Graham, Jessie B. Kennedy
DM
2011
158views Education» more  DM 2011»
12 years 11 months ago
A survey of homogeneous structures
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
Dugald Macpherson