Sciweavers

2864 search results - page 461 / 573
» Constraint Programming in OPL
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 9 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
COR
2008
99views more  COR 2008»
13 years 9 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»
13 years 9 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»
13 years 9 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