1554 search results - page 215 / 311 » Parameterized Complexity and Approximation Algorithms |
115
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
111
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
169
click to vote
TACAS
1998
Springer
15 years 7 months ago
1998
Springer
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
124
click to vote
DATE
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper proposes a new hierarchical circuit modeling and simulation technique in s-domain for linear analog circuits. The new algorithm can perform circuit complexity reduction...
130
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...