123 search results - page 18 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
WAOA
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
COMCOM
1998
13 years 7 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
INFOCOM
2005
IEEE
14 years 28 days ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
WAW
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...