Sciweavers

6251 search results - page 849 / 1251
» Randomness, Computability, and Density
Sort
View
INFORMATICALT
2006
105views more  INFORMATICALT 2006»
15 years 7 months ago
Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
Yu Long, Kefei Chen, Shengli Liu
IOR
2006
93views more  IOR 2006»
15 years 7 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
IOR
2006
173views more  IOR 2006»
15 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
JCC
2006
57views more  JCC 2006»
15 years 7 months ago
A search algorithm for fixed-composition protein design
: We present a computational protein design algorithm for finding low-energy sequences of fixed amino acid composition. The search algorithms used in protein design typically do no...
Geoffrey K. Hom, Stephen L. Mayo
JSAT
2008
85views more  JSAT 2008»
15 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren