110 search results - page 13 / 22 » Exact solutions to a class of stochastic generalized assignm... |
EOR
2008
14 years 11 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
108
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
120
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
124
click to vote
PODS
2003
ACM
15 years 11 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
HYBRID
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...