Sciweavers

159 search results - page 14 / 32
» Analysis of One-Way Reservation Algorithms
Sort
View
HPDC
2009
IEEE
14 years 4 months ago
Resource co-allocation for large-scale distributed environments
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
Claris Castillo, George N. Rouskas, Khaled Harfous...
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
13 years 10 months ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin
ATAL
2005
Springer
14 years 1 days ago
Automated resource-driven mission phasing techniques for constrained agents
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...
Jianhui Wu, Edmund H. Durfee
ICC
2009
IEEE
144views Communications» more  ICC 2009»
14 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
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 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...