Sciweavers

6554 search results - page 1126 / 1311
» Constraint Logic Programming
Sort
View
COR
2008
99views more  COR 2008»
15 years 4 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 4 months ago
Algorithmic Thermodynamics
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodyna...
John C. Baez, Mike Stay
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 4 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
EC
2008
146views ECommerce» more  EC 2008»
15 years 4 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
AUTOMATICA
2006
132views more  AUTOMATICA 2006»
15 years 4 months ago
A new autocovariance least-squares method for estimating noise covariances
Industrial implementation of model-based control methods, such as model predictive control, is often complicated by the lack of knowledge about the disturbances entering the syste...
Brian J. Odelson, Murali R. Rajamani, James B. Raw...
« Prev « First page 1126 / 1311 Last » Next »