Sciweavers

505 search results - page 51 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
14 years 9 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
ICASSP
2009
IEEE
15 years 6 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
EUC
2005
Springer
15 years 5 months ago
Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
Yong-Jin Lee, Mohammed Atiquzzaman
ICDCS
2011
IEEE
13 years 11 months ago
Delay-Cognizant Reliable Delivery for Publish/Subscribe Overlay Networks
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei,...
DCC
2003
IEEE
15 years 11 months ago
Rate-distortion Optimized Packet Scheduling and Routing for Media Streaming with Path Diversity
We consider diversity for media streaming in a rate-distortion optimization framework. A sender-driven transmission scenario is investigated, where diversity is achieved by using ...
Jacob Chakareski, Bernd Girod