Sciweavers

4075 search results - page 125 / 815
» Modeling Distributed Algorithm Using B
Sort
View
COLT
2010
Springer
13 years 8 months ago
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
Junya Honda, Akimichi Takemura
AMC
2005
136views more  AMC 2005»
13 years 10 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
INFOCOM
2003
IEEE
14 years 3 months ago
Distributed Admission Control to Support Guaranteed Services in Core-Stateless Networks
— The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admissio...
Sudeept Bhatnagar, B. R. Badrinath
IJHPCA
2006
113views more  IJHPCA 2006»
13 years 10 months ago
Heterogeneity-Aware Workload Distribution in Donation-Based Grids
In this paper, we explore the tradeoffs and opportunities in porting a high-throughput Grid computing middleware to a high-performance service oriented environment. We present the...
Rahul Trivedi, Abhishek Chandra, Jon B. Weissman
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 10 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan