Sciweavers

63 search results - page 13 / 13
» Bounds on linear PDEs via semidefinite optimization
Sort
View
IOR
2007
106views more  IOR 2007»
14 years 9 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
JMLR
2002
89views more  JMLR 2002»
14 years 9 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
JNCA
2011
137views more  JNCA 2011»
14 years 4 months ago
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
Shanshan Jiang, Yuan Xue