Sciweavers

2027 search results - page 27 / 406
» When is it best to best-respond
Sort
View
NIPS
2004
13 years 11 months ago
Online Bounds for Bayesian Algorithms
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
Sham M. Kakade, Andrew Y. Ng
DGCI
2008
Springer
13 years 11 months ago
Optimal Difference Operator Selection
Abstract. Differential operators are essential in many image processing applications. Previous work has shown how to compute derivatives more accurately by examining the image loca...
Peter Veelaert, Kristof Teelen
FLAIRS
2010
13 years 10 months ago
Using Intelligent Agents to Build Navigation Meshes
We present a novel algorithm that allows agents to discover a navigation mesh for an environment as they move through the environment. The Navigation-Mesh Automated Discovery (NMA...
D. Hunter Hale, G. Michael Youngblood, Nikhil S. K...
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
13 years 9 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang
TWC
2008
145views more  TWC 2008»
13 years 8 months ago
Generalized Window-Based PN Acquisition Scheme in CDMA Spread Spectrum Systems
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
Kwang Man Ok, Chung Gu Kang