Sciweavers

1933 search results - page 120 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
TCS
2008
15 years 6 months ago
On the power of lookahead in on-line server routing problems
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...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
IJAIT
2010
167views more  IJAIT 2010»
15 years 4 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
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...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
WWW
2001
ACM
16 years 7 months ago
Improving Web Site's Accessibility
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 ...
John D. Garofalakis, Panagiotis Kappos, Christos M...
AE
2007
Springer
16 years 17 days ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
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...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
IJACTAICIT
2010
153views more  IJACTAICIT 2010»
15 years 1 months ago
Prediction Using Recurrent Neural Network Based Fuzzy Inference system by the Modified Bees Algorithm
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...
Zahra Khanmirzaei, Mohammad Teshnehlab