Sciweavers

53 search results - page 5 / 11
» Minimally Infeasible Set-Partitioning Problems with Balanced...
Sort
View
FOCS
2000
IEEE
13 years 10 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
14 years 20 days ago
Constraint-driven bus matrix synthesis for MPSoC
– Modern multi-processor system-on-chip (MPSoC) designs have high bandwidth constraints which must be satisfied by the underlying communication architecture. Bus matrix based com...
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...
FROCOS
2009
Springer
13 years 10 months ago
Efficient Combination of Decision Procedures for MUS Computation
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
INFOCOM
2009
IEEE
14 years 1 months ago
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints
Continuous monitoring and diagnosis of network performance are of crucial importance for the Internet access service and virtual private network (VPN) service providers. Various o...
Yao Zhao, Zhaosheng Zhu, Yan Chen, Dan Pei, Jia Wa...
WWW
2007
ACM
14 years 7 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman