1639 search results - page 167 / 328 » Degree-constrained network flows |
148
Voted
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
136
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
140
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
140
click to vote
JAIR
2008
15 years 4 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
113
Voted
ISQED
2007
IEEE
15 years 11 months ago
2007
IEEE
The virtual channel flow control (VCFC) provides an efficient implementation for on-chip networks. However, allocating the virtual channels (VCs) uniformly results in a waste of a...