14774 search results - page 88 / 2955 » Computational complexity and evolutionary computation |
122
click to vote
IJAC
2002
15 years 3 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
134
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
121
Voted
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
147
click to vote
FCT
1991
Springer
15 years 7 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
117
click to vote
SP
2008
IEEE
15 years 3 months ago
2008
IEEE
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...