14165 search results - page 275 / 2833 » The generalized two-server problem |
205
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
136
click to vote
ICSE
2008
IEEE-ACM
16 years 6 months ago
2008
IEEE-ACM
Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
169
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
162
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
Computer problem diagnosis remains a serious challenge to users and support professionals. Traditional troubleshooting methods relying heavily on human intervention make the proce...
165
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...