90 search results - page 7 / 18 » Maximizing expected utility over a knapsack constraint |
71
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We study the dissemination of dynamic content, such as news or traffic information, over a mobile social network. In this application, mobile users subscribe to a dynamic-conte...
109
click to vote
TCSV
2010
14 years 4 months ago
2010
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 1 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
75
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—An emerging killer application for enterprise wireless LANs (WLANs) is voice over IP (VoIP) telephony, which promises to greatly improve the reachability and mobility of...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...