1933 search results - page 120 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
129
Voted
TCS
2008
15 years 3 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
119
Voted
IJAIT
2010
15 years 2 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
111
Voted
WWW
2001
ACM
16 years 4 months ago
2001
ACM
We consider the problem of improving the performance of web access by proposing a reconstruction of the internal link structure of a web site in order to match the quality of the ...
112
Voted
AE
2007
Springer
15 years 10 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
167
Voted
IJACTAICIT
2010
14 years 10 months ago
2010
In this paper, a recurrent neural network based fuzzy inference system (RNFIS) for prediction is proposed. A recurrent network is embedded in the RNFIS by adding feedback connecti...