187 search results - page 33 / 38 » Approximation Algorithms for Multiprocessor Scheduling under... |
INFOCOM
2003
IEEE
14 years 28 days ago
2003
IEEE
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
COCOON
1999
Springer
13 years 12 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...