261 search results - page 37 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
73
Voted
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
171
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
82
Voted
RANDOM
2001
Springer
15 years 1 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
80
Voted
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...