Sciweavers

892 search results - page 134 / 179
» et 2007
Sort
View
CP
2007
Springer
14 years 2 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert
CPAIOR
2007
Springer
14 years 2 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
CTRSA
2007
Springer
184views Cryptology» more  CTRSA 2007»
14 years 2 months ago
Cryptanalysis of Reduced Variants of the FORK-256 Hash Function
FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we pre...
Florian Mendel, Joseph Lano, Bart Preneel
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
14 years 2 months ago
Autonomous Programmable Nanorobotic Devices Using DNAzymes
Abstract. A major challenge in nanoscience is the design of synthetic molecular devices that run autonomously and are programmable. DNA-based synthetic molecular devices have the a...
John H. Reif, Sudheer Sahu