204 search results - page 11 / 41 » Parameterized Complexity of Cardinality Constrained Optimiza... |
117
Voted
TPDS
2002
14 years 11 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
75
Voted
IJSYSC
2010
14 years 10 months ago
2010
This paper applies three different control techniques to the design of a quarter car semiactive suspension system. The three techniques, originally developed to solve a constrain...
106
click to vote
JOTA
2011
14 years 2 months ago
2011
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
98
Voted
AINA
2004
IEEE
15 years 3 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
DAM
2006
14 years 11 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...