427 search results - page 65 / 86 » A Subexponential Bound for Linear Programming |
102
Voted
DSN
2009
IEEE
15 years 8 months ago
2009
IEEE
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
143
click to vote
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
103
click to vote
EUROCAST
2005
Springer
15 years 7 months ago
2005
Springer
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
107
click to vote
NIPS
2008
15 years 2 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
102
click to vote
INFORMS
2000
15 years 1 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...