Sciweavers

1132 search results - page 167 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
16 years 29 days ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
SECON
2008
IEEE
16 years 23 days ago
Per User Throughput in Large Wireless Networks
— Previous results show that a node’s throughput scales poorly as the network size increases when every node has traffic. However, in many cases, only a fraction of nodes in l...
Dan Xu, Xin Liu
INFOCOM
2007
IEEE
16 years 20 days ago
Joint Optimal Channel Probing and Transmission in Collocated Wireless Networks
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
Dong Zheng, Junshan Zhang
IROS
2007
IEEE
107views Robotics» more  IROS 2007»
16 years 20 days ago
Scheduling for humans in multirobot supervisory control
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
Sandra Mau, John M. Dolan