874 search results - page 71 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
113
click to vote
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
112
click to vote
SECON
2010
IEEE
14 years 7 months ago
2010
IEEE
Wireless communications over water may suffer from serious multipath fading due to strong specular reflections from conducting water surfaces. Cognitive radios enable dynamic spect...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
AIPS
2004
14 years 11 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...