Sciweavers

94 search results - page 14 / 19
» Non-clairvoyant Scheduling Games
Sort
View
76
Voted
ACSC
2007
IEEE
15 years 3 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
INFOCOM
2010
IEEE
14 years 8 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
CCGRID
2011
IEEE
14 years 1 months ago
Towards Real-Time, Volunteer Distributed Computing
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David ...
71
Voted
TCS
2008
14 years 9 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
JPDC
2008
128views more  JPDC 2008»
14 years 9 months ago
An interference-aware fair scheduling for multicast in wireless mesh networks
Multicast is a fundamental routing service in wireless mesh networks (WMNs) due to its many potential applications such as video conferencing, online games, and webcast. Recently,...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...