1254 search results - page 54 / 251 » Making Hard Problems Harder |
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Knowledge elicitation is known to be a difficult task and thus a major bottleneck in building a knowledge base. Machine learning has long ago been proposed as a way to alleviate th...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We consider the problem of joint end-to-end rate optimization and radio resource management in wireless OFDMA-based mesh networks. Radio units equipped with multiple radio inte...