Sciweavers

1723 search results - page 46 / 345
» Cycling in linear programming problems
Sort
View
135
Voted
NETWORKS
2008
15 years 2 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
TPDS
2008
64views more  TPDS 2008»
15 years 2 months ago
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
Issam Al-Azzoni, Douglas G. Down
IOR
2008
109views more  IOR 2008»
15 years 2 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
117
Voted
ACL
2010
15 years 18 days ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
146
Voted
HYBRID
2009
Springer
15 years 9 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...