Sciweavers

679 search results - page 80 / 136
» hybrid 2010
Sort
View
EAAI
2006
92views more  EAAI 2006»
13 years 10 months ago
Solving terminal assignment problems with groups encoding: The wedding banquet problem
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an e...
Sancho Salcedo-Sanz, José Antonio Portilla-...
ENTCS
2006
124views more  ENTCS 2006»
13 years 10 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
EOR
2007
87views more  EOR 2007»
13 years 10 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
EOR
2007
90views more  EOR 2007»
13 years 10 months ago
Structural models in consumer credit
We propose a structural credit risk model for consumer lending using option theory and the concept of the value of the consumer’s reputation. Using Brazilian empirical data and ...
Fabio Wendling Muniz de Andrade, Lyn C. Thomas
LATINCRYPT
2010
13 years 8 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...