Sciweavers

4843 search results - page 882 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
14 years 7 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 7 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
EOR
2010
113views more  EOR 2010»
14 years 7 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
14 years 5 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
CDC
2010
IEEE
14 years 5 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy