118 search results - page 18 / 24 » Complexity Cores and Hard Problem Instances |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
CIAC
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
GPCE
2004
Springer
14 years 22 days ago
2004
Springer
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...