7106 search results - page 881 / 1422 » Restricted Complexity, General Complexity |
189
click to vote
ECCC
2000
15 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
183
click to vote
CN
1998
15 years 6 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
190
click to vote
TIT
2002
15 years 6 months ago
2002
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
193
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...
188
click to vote
COMCOM
2010
15 years 5 months ago
2010
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...