Sciweavers

5624 search results - page 434 / 1125
» On Conditional Covering Problem
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 7 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
CLEIEJ
2007
86views more  CLEIEJ 2007»
15 years 7 months ago
Requirements Game: Teaching Software Project Management
: Several business areas, like Management and Negotiation, have used games like a didactic way to simulate world reality, to introduce students to the day-to-day generated problems...
Carlos Mario Zapata Jaramillo, Gabriel Awad-Aubad
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 6 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
ENTCS
2007
75views more  ENTCS 2007»
15 years 6 months ago
Testing Planning Domains (without Model Checkers)
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
Franco Raimondi, Charles Pecheur, Guillaume Brat