Sciweavers

5580 search results - page 362 / 1116
» Randomized priority algorithms
Sort
View
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 7 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...
IOR
2006
93views more  IOR 2006»
15 years 7 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 7 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
ML
2000
ACM
105views Machine Learning» more  ML 2000»
15 years 7 months ago
Multiple Comparisons in Induction Algorithms
Abstract. A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction ...
David D. Jensen, Paul R. Cohen
162
Voted
IAJIT
2010
94views more  IAJIT 2010»
15 years 5 months ago
Multiple Warehouses Scheduling Using Steady State. Genetic Algorithms
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
Jalal Atoum, Mamoun Al Rababaa