Sciweavers

1127 search results - page 26 / 226
» New Algorithms for Generalized Network Flows
Sort
View
DATE
2003
IEEE
124views Hardware» more  DATE 2003»
15 years 3 months ago
Hierarchical Global Floorplacement Using Simulated Annealing and Network Flow Area Migration
– Floorplanning large designs with many hard macros and IP blocks of various sizes is becoming an increasingly important and challenging problem. This paper presents a global flo...
Wonjoon Choi, Kia Bazargan
PCI
2005
Springer
15 years 3 months ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
15 years 3 months ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...
MFCS
2009
Springer
15 years 4 months ago
The Cost of Stability in Network Flow Games
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey...
CORR
2011
Springer
261views Education» more  CORR 2011»
14 years 5 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...