Sciweavers

1891 search results - page 333 / 379
» Constrained Subspace Modelling
Sort
View
JCO
2006
67views more  JCO 2006»
13 years 9 months ago
Resource allocation for restoration of compromised systems
Computer systems are constantly under the threats of being attacked and in many cases these attacks succeed. Today's networked systems are thus built to be intrusion tolerant....
Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong
JMLR
2006
156views more  JMLR 2006»
13 years 9 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
ENTCS
2007
103views more  ENTCS 2007»
13 years 9 months ago
Policy-based Coordination in PAGODA: A Case Study
PAGODA (Policy And GOal Based Distributed Autonomy) is a modular architecture for specifying and prototyping autonomous systems. A PAGODA node (agent) interacts with its environme...
Carolyn L. Talcott
MP
2006
107views more  MP 2006»
13 years 9 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
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 9 months ago
A Logic-Based Approach to Combinatorial Testing with Constraints
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
Andrea Calvagna, Angelo Gargantini