1871 search results - page 245 / 375 » The Ephemeral Pairing Problem |
156
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
162
click to vote
ALT
2000
Springer
15 years 11 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
180
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
161
click to vote
RIVF
2007
15 years 8 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
167
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...