Sciweavers

803 search results - page 142 / 161
» Multiply-constrained distributed constraint optimization
Sort
View
ATAL
2010
Springer
14 years 10 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
70
Voted
MOBICOM
2010
ACM
14 years 9 months ago
Intentional networking: opportunistic exploitation of mobile network diversity
Mobile devices face a diverse and dynamic set of networking options. Using those options to the fullest requires knowledge of application intent. This paper describes Intentional ...
Brett D. Higgins, Azarias Reda, Timur Alperovich, ...
ADHOC
2007
169views more  ADHOC 2007»
14 years 9 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
BMCBI
2008
153views more  BMCBI 2008»
14 years 9 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
BMCBI
2010
132views more  BMCBI 2010»
14 years 9 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...