Sciweavers

9412 search results - page 207 / 1883
» An aspect-oriented generative approach
Sort
View
STACS
2009
Springer
16 years 1 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
DATE
2009
IEEE
85views Hardware» more  DATE 2009»
16 years 1 months ago
Faster SAT solving with better CNF generation
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
Benjamin Chambers, Panagiotis Manolios, Daron Vroo...
IROS
2009
IEEE
168views Robotics» more  IROS 2009»
16 years 1 months ago
On the generation of feasible paths for aerial robots in environments with obstacles
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...
Douglas Guimarães Macharet, Armando Alves N...
TPHOL
2009
IEEE
16 years 1 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
16 years 1 months ago
Using automated search to generate test data for matlab
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
Sion Ll Rhys, Simon M. Poulding, John A. Clark