914 search results - page 35 / 183 » Branch and Bound on the Network Model |
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
75
Voted
DSN
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
93
Voted
JETAI
2010
14 years 8 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
IFM
2009
Springer
15 years 4 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
PODC
2011
ACM
14 years 15 days ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...