14165 search results - page 46 / 2833 » The generalized two-server problem |
126
click to vote
CSFW
2011
IEEE
14 years 1 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
214
Voted
DISOPT
2011
14 years 9 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
160
click to vote
FOGA
2011
14 years 5 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
113
click to vote
MA
2011
Springer
14 years 9 months ago
2011
Springer
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
151
click to vote
TNN
2010
14 years 8 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...