Sciweavers

6202 search results - page 5 / 1241
» Without Loss of Generality
Sort
View
IJAR
1998
54views more  IJAR 1998»
14 years 9 months ago
Quantized norms and generalized relational composition on dense universes
Decision-making procedure based on fuzzy relational composition may require that the involved connectives are not idempotent to handle signi cant information properly. Yet, non-id...
Riccardo Rovatti, Cesare Fantuzzi
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Truthful assignment without money
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...
Shaddin Dughmi, Arpita Ghosh
ICS
2011
Tsinghua U.
14 years 1 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
BMCBI
2007
115views more  BMCBI 2007»
14 years 10 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...
MOBIHOC
2007
ACM
15 years 9 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...