Sciweavers

1941 search results - page 123 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
IMC
2007
ACM
14 years 11 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
ACMSE
2004
ACM
15 years 3 months ago
Recent advances in mobility modeling for mobile ad hoc network research
In this paper, we survey recent advances in mobility modeling for mobile ad hoc network research. The advances include some new mobility models and analysis of older mobility mode...
Qunwei Zheng, Xiaoyan Hong, Sibabrata Ray
IPPS
2009
IEEE
15 years 4 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 10 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking