973 search results - page 127 / 195 » New Bounds on Crossing Numbers |
182
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
183
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
189
click to vote
TC
2010
15 years 27 days ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
178
click to vote
CDC
2008
IEEE
16 years 20 days ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
149
click to vote
IPPS
2007
IEEE
16 years 14 days ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...