Sciweavers

1725 search results - page 256 / 345
» Relaxed genetic programming
Sort
View
CORR
2008
Springer
124views Education» more  CORR 2008»
14 years 10 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
JCO
2006
64views more  JCO 2006»
14 years 10 months ago
Traffic engineering of tunnel-based networks with class specific diversity requirements
Tunnel-based networks such as Multi-protocol Label switching (MPLS) are suitable for providing diversity guarantees to different service classes or customers. Based on the number ...
Shekhar Srivastava, Deep Medhi
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
MP
2006
101views more  MP 2006»
14 years 9 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
SIAMJO
2002
77views more  SIAMJO 2002»
14 years 9 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright