Sciweavers

89 search results - page 5 / 18
» Fast paths in large-scale dynamic road networks
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
Adaptive and dynamic intrusion detection by means of idiotypic networks paradigm
—In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring vari...
Marek Ostaszewski, Pascal Bouvry, Franciszek Sered...
CORR
2008
Springer
185views Education» more  CORR 2008»
13 years 7 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 1 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
13 years 2 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano