Sciweavers

3088 search results - page 254 / 618
» Online Passive-Aggressive Algorithms
Sort
View
JMLR
2002
140views more  JMLR 2002»
15 years 6 months ago
On Boosting with Polynomially Bounded Distributions
We construct a framework which allows an algorithm to turn the distributions produced by some boosting algorithms into polynomially smooth distributions (w.r.t. the PAC oracle...
Nader H. Bshouty, Dmitry Gavinsky
JSAC
2010
142views more  JSAC 2010»
15 years 5 months ago
Cross-layer optimization for streaming scalable video over fading wireless networks
—We present a cross-layer design of transmitting scalable video streams from a base station to multiple clients over a shared fading wireless network by jointly considering the a...
Honghai Zhang, Yanyan Zheng, Mohammad A. Khojastep...
169
Voted
IJRR
2010
115views more  IJRR 2010»
15 years 3 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
CIDR
2011
342views Algorithms» more  CIDR 2011»
14 years 10 months ago
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Megastore is a storage system developed to meet the requirements of today’s interactive online services. Megastore blends the scalability of a NoSQL datastore with the convenien...
Jason Baker, Chris Bond, James Corbett, J. J. Furm...
AAAI
2011
14 years 6 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis