Sciweavers

6592 search results - page 110 / 1319
» On robust cycle bases
Sort
View
EOR
2006
104views more  EOR 2006»
15 years 6 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve
JSSPP
2005
Springer
15 years 12 months ago
Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
Dayi Zhou, Virginia Mary Lo
CORR
2002
Springer
94views Education» more  CORR 2002»
15 years 6 months ago
Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
The problem of making sequential decisions in unknown probabilistic environments is studied. In cycle t action yt results in perception xt and reward rt, where all quantities in g...
Marcus Hutter
MA
2011
Springer
285views Communications» more  MA 2011»
15 years 1 months ago
Dual divergence estimators and tests: Robustness results
The class of dual φ-divergence estimators (introduced in Broniatowski and Keziou (2009) [6]) is explored with respect to robustness through the influence function approach. For ...
Aida Toma, Michel Broniatowski
ECCV
2006
Springer
16 years 8 months ago
Subspace Estimation Using Projection Based M-Estimators over Grassmann Manifolds
Abstract. We propose a solution to the problem of robust subspace estimation using the projection based M-estimator. The new method handles more outliers than inliers, does not req...
Raghav Subbarao, Peter Meer