Sciweavers

706 search results - page 104 / 142
» Super Solutions in Constraint Programming
Sort
View
ICASSP
2010
IEEE
14 years 12 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...
AUTOMATICA
2005
178views more  AUTOMATICA 2005»
14 years 11 months ago
Spacecraft attitude control using explicit model predictive control
In this paper, an explicit model predictive controller for the attitude of a satellite is designed. Explicit solutions to constrained linear MPC problems can be computed by solvin...
Øyvind Hegrenæs, Jan Tommy Gravdahl, ...
AIPS
2009
15 years 27 days ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
IOR
2007
106views more  IOR 2007»
14 years 11 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
GLOBECOM
2006
IEEE
15 years 5 months ago
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
Satyajeet Ahuja, Marwan Krunz