Sciweavers

5263 search results - page 426 / 1053
» Open Constraint Optimization
Sort
View
NIPS
2004
15 years 8 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
UAI
2004
15 years 8 months ago
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
Hei Chan, Adnan Darwiche
NIPS
2003
15 years 8 months ago
Ambiguous Model Learning Made Unambiguous with 1/f Priors
What happens to the optimal interpretation of noisy data when there exists more than one equally plausible interpretation of the data? In a Bayesian model-learning framework the a...
Gurinder S. Atwal, William Bialek
AI
2008
Springer
15 years 7 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne
EOR
2006
61views more  EOR 2006»
15 years 6 months ago
Scheduling trainees at a hospital department using a branch-and-price approach
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
Jeroen Beliën, Erik Demeulemeester