2714 search results - page 272 / 543 » Approximation Schemes for Scheduling |
128
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...
119
click to vote
KBSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
126
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Much attention has been paid to the problem of optimally utilizing resources such as spectrum, power and time in order to achieve the best video delivery quality in wireless commu...
119
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
104
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...