14158 search results - page 61 / 2832 » Generalized switch-setting problems |
PROCEDIA
2010
13 years 8 months ago
2010
We present an adaptive multilevel generalized SQP method to solve PDAE-constrained optimization problems. It explicitly allows the use of independent integration schemes such that...
ORL
1998
13 years 9 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
DAM
2011
13 years 5 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
CSFW
2011
IEEE
12 years 9 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...