Sciweavers

4894 search results - page 556 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
MP
2006
107views more  MP 2006»
15 years 4 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
AUTOMATICA
2005
103views more  AUTOMATICA 2005»
15 years 4 months ago
Incorporating state estimation into model predictive control and its application to network traffic control
Model predictive control (MPC) is of interest because it is one of the few control design methods which preserves standard design variables and yet handles constraints. MPC is nor...
Jun Yan, Robert R. Bitmead
TSP
2008
122views more  TSP 2008»
15 years 4 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 4 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
MFCS
2010
Springer
15 years 3 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...