236 search results - page 24 / 48 » A New Neighborhood Based on Improvement Graph for Robust Gra... |
CIE
2007
Springer
14 years 2 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
WWW
2008
ACM
14 years 9 months ago
2008
ACM
The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in questio...
PPSN
2000
Springer
14 years 20 hour ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
JCP
2008
13 years 8 months ago
2008
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...