Sciweavers

740 search results - page 90 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 4 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
15 years 2 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
EOR
2007
80views more  EOR 2007»
14 years 9 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
CORR
2008
Springer
85views Education» more  CORR 2008»
14 years 10 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 3 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...