Sciweavers

94 search results - page 16 / 19
» Competitive Memetic Algorithms for Arc Routing Problems
Sort
View
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 8 days ago
Empirical Study on Inferring BGP Routing Instability and its Location Based on Single Point Observation
As the Internet has become a communication infrastructure, inter-domain routing instabilities have become prone to serious problems. Some studies have proposed methods that infer i...
Tomohiko Ogishi, Yuichiro Hei, Shigehiro Ano, Toru...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 6 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
SPAA
2004
ACM
14 years 1 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
IPPS
2006
IEEE
14 years 2 months ago
FPGA based architecture for DNA sequence comparison and database search
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Euripides Sotiriades, Christos Kozanitis, Apostolo...