14158 search results - page 61 / 2832 » Generalized switch-setting problems |
128
Voted
PROCEDIA
2010
15 years 22 days 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...
108
click to vote
ORL
1998
15 years 2 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 ...
171
click to vote
DAM
2011
14 years 9 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...
113
click to vote
CORR
2010
Springer
15 years 28 days 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...
132
click to vote
CSFW
2011
IEEE
14 years 2 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...