Sciweavers

2042 search results - page 276 / 409
» Variable Number of
Sort
View
AAAI
2000
15 years 5 months ago
A Unified Bias-Variance Decomposition for Zero-One and Squared Loss
The bias-variance decomposition is a very useful and widely-used tool for understanding machine-learning algorithms. It was originally developed for squared loss. In recent years,...
Pedro Domingos
EOR
2007
101views more  EOR 2007»
15 years 4 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
STACS
2010
Springer
15 years 11 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
ISICA
2007
Springer
15 years 10 months ago
Interplanetary Trajectory Optimization with Swing-Bys Using Evolutionary Multi-objective Optimization
Abstract. Interplanetary trajectory optimization studies mostly considered a single objective of minimizing travel time between two planets or launch velocity of spacecraft at the ...
Kalyanmoy Deb, Nikhil Padhye, Ganesh Neema
ICALP
2010
Springer
15 years 9 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström