Sciweavers

5506 search results - page 890 / 1102
» Minimal Logic Programs
Sort
View
JGO
2010
100views more  JGO 2010»
13 years 3 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 3 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
12 years 12 months ago
Partial pole placement with minimum norm controller
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
Subashish Datta, Balarko Chaudhuri, Debraj Chakrab...
CEC
2010
IEEE
12 years 12 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
ASPLOS
2011
ACM
12 years 12 months ago
Ensuring operating system kernel integrity with OSck
Kernel rootkits that modify operating system state to avoid detection are a dangerous threat to system security. This paper presents OSck, a system that discovers kernel rootkits ...
Owen S. Hofmann, Alan M. Dunn, Sangman Kim, Indraj...