Sciweavers

517 search results - page 76 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
AAAI
2008
15 years 8 days ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
IPPS
2000
IEEE
15 years 2 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
FOCS
2000
IEEE
15 years 2 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
MOBIHOC
2008
ACM
15 years 9 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan