Sciweavers

200 search results - page 14 / 40
» Approximation Algorithms for Scheduling on Multiple Machines
Sort
View
AAAI
1998
13 years 9 months ago
Multi Machine Scheduling: An Agent-Based Approach
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
Rama Akkiraju, Pinar Keskinocak, Sesh Murthy, Fred...
ICML
2004
IEEE
14 years 8 months ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
INFOCOM
2008
IEEE
14 years 2 months ago
Embracing Interference in Ad Hoc Networks Using Joint Routing and Scheduling with Multiple Packet Reception
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
Xin Wang, J. J. Garcia-Luna-Aceves
ICNP
2007
IEEE
14 years 2 months ago
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
Abstract—Radio frequency identification (RFID) is a technology where a reader device can “sense” the presence of a closeby object by reading a tag device attached to the obj...
Zongheng Zhou, Himanshu Gupta, Samir R. Das, Xianj...
AOR
2007
107views more  AOR 2007»
13 years 7 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...