118 search results - page 12 / 24 » The Shortest Path Problem Under Partial Monitoring |
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Proper admission control in cognitive radio networks is critical in providing QoS guarantees to secondary unlicensed users. In this paper, we study the admission control ...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
MOR
2008
13 years 8 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
ICDCS
1999
IEEE
14 years 22 days ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
ACTA
2010
13 years 8 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...