Sciweavers

909 search results - page 111 / 182
» On the approximability of some network design problems
Sort
View
ICOIN
2007
Springer
16 years 15 days ago
Balanced Multipath Source Routing
Abstract. We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, start...
Shreyas Prasad, André Schumacher, Harri Haa...
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 6 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
BMCBI
2006
112views more  BMCBI 2006»
15 years 6 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 7 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...