Sciweavers

1912 search results - page 70 / 383
» Optimizing interconnection policies
Sort
View
TIT
2010
115views Education» more  TIT 2010»
13 years 4 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
NIPS
2007
13 years 10 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
POLICY
2007
Springer
14 years 3 months ago
On Automated Policy Generation for Mobile Ad Hoc Networks
In this paper we describe an approach to the problem of automated policy generation for mobile ad hoc networks. The automated policy generation problem is difficult in its own rig...
Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb...
ASPLOS
1991
ACM
14 years 26 days ago
NUMA Policies and Their Relation to Memory Architecture
Multiprocessor memory reference traces provide a wealth of information on the behavior of parallel programs. We have used this information to explore the relationship between kern...
William J. Bolosky, Michael L. Scott, Robert P. Fi...
NETCOOP
2009
Springer
14 years 3 months ago
Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
Eitan Altman