Sciweavers

3694 search results - page 151 / 739
» Stochastic complexity in learning
Sort
View
AUTOMATICA
2011
13 years 5 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
JSAC
2011
100views more  JSAC 2011»
13 years 1 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
WSC
1998
13 years 11 months ago
Rostering by Iterating Integer Programming and Simulation
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
Shane G. Henderson, Andrew J. Mason
ICCBR
2005
Springer
14 years 3 months ago
On the Effectiveness of Automatic Case Elicitation in a More Complex Domain
Automatic case elicitation (ACE) is a learning technique in which a case-based reasoning system acquires knowledge automatically from scratch through repeated real-time trial and e...
Siva N. Kommuri, Jay H. Powell, John D. Hastings
ICML
2006
IEEE
14 years 11 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire