4526 search results - page 98 / 906 » Algorithmic problems related to the Internet |
123
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we discuss the potential for semantic search and focus on the most immediate problem toward its realization: the problem of the sparsity and relatively low quality of...
134
click to vote
AAAI
2006
15 years 5 months ago
2006
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
128
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
126
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The ability to design thermostable proteins is theoretically important and practically useful. Robust and accurate algorithms, however, remain elusive. One critical pr...
144
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...