Sciweavers

15494 search results - page 360 / 3099
» Computing dynamic clusters
Sort
View
204
Voted
FGCS
2007
89views more  FGCS 2007»
15 years 6 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
IPPS
2000
IEEE
15 years 11 months ago
Optimal Periodic Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
Ngo-Tai Fong, Cheng-Zhong Xu, Le Yi Wang
ICCV
2007
IEEE
16 years 8 months ago
DynamicBoost: Boosting Time Series Generated by Dynamical Systems
Boosting is a remarkably simple and flexible classification algorithm with widespread applications in computer vision. However, the application of boosting to nonEuclidean, infini...
René Vidal, Paolo Favaro
ICDCS
1998
IEEE
15 years 11 months ago
Optimal Channel Allocation for Data Dissemination in Mobile Computing Environments
This paper discusses wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels ar...
Qinglong Hu, Dik Lun Lee, Wang-Chien Lee
TRANSCI
2010
101views more  TRANSCI 2010»
15 years 5 months ago
Computing Time-Dependent Bid Prices in Network Revenue Management Problems
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
Sumit Kunnumkal, Huseyin Topaloglu