14548 search results - page 381 / 2910 » The Optimal Path-Matching Problem |
170
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
An e cient solution to the wire sizing problem WSP usingthe Elmoredelaymodelisproposed. Two formulations of the problem are put forth: in the rst, the minimum interconnect delay i...
184
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...
175
click to vote
INFORMATICALT
2002
15 years 6 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
198
click to vote
AIPS
2011
14 years 10 months ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
180
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...