483 search results - page 88 / 97 » On perfectness of sums of graphs |
WINE
2010
Springer
13 years 6 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
JMLR
2012
11 years 11 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
MIDDLEWARE
2007
Springer
14 years 2 months ago
2007
Springer
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...