Sciweavers

187 search results - page 10 / 38
» Bounding the cost of learned rules
Sort
View
IOR
2010
90views more  IOR 2010»
13 years 5 months ago
No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems. We assume that component in...
Yingdong Lu, Jing-Sheng Song, Yao Zhao
ICML
2008
IEEE
14 years 8 months ago
Multi-classification by categorical features via clustering
We derive a generalization bound for multiclassification schemes based on grid clustering in categorical parameter product spaces. Grid clustering partitions the parameter space i...
Yevgeny Seldin, Naftali Tishby
ICML
2010
IEEE
13 years 5 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
ATAL
2009
Springer
14 years 1 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski
AIIDE
2007
13 years 9 months ago
Automatic Rule Ordering for Dynamic Scripting
The goal of adaptive game AI is to enhance computercontrolled game-playing agents with (1) the ability to selfcorrect mistakes, and (2) creativity in responding to new situations....
Timor Timuri, Pieter Spronck, H. Jaap van den Heri...