11740 search results - page 380 / 2348 » More Problems in Rewriting |
177
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
194
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
174
click to vote
RTAS
2008
IEEE
16 years 1 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
182
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
173
click to vote
SAT
2007
Springer
16 years 26 days ago
2007
Springer
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...