1897 search results - page 39 / 380 » Conditional Linear Planning |
NETCOOP
2007
Springer
15 years 4 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
ICASSP
2011
IEEE
2011
IEEE
An uniqueness condition for the 4-way CANDECOMP/PARAFAC model with collinear loadings in three modes
14 years 1 months ago
In this paper we investigate the uniqueness of the 4-way CANDECOMP/PARAFAC (CP) model in the case where the only possible linear dependencies between the columns of the loading ma...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— The constructions of optical buffers is one of the most critically sought after optical technologies in all-optical packet-switched networks, and constructing optical buffers d...
147
click to vote
POPL
2001
ACM
15 years 10 months ago
2001
ACM
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
MP
2006
14 years 9 months ago
2006
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...