464 search results - page 29 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
115
click to vote
ATVA
2011
Springer
14 years 14 days ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
93
Voted
FASE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The problem of interpreting the results of software performance analysis is very critical. Software developers expect feedbacks in terms of architectural design alternati...
113
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
102
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
99
Voted
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...