Sciweavers

1336 search results - page 234 / 268
» SMTP Path Analysis
Sort
View
GLOBECOM
2010
IEEE
13 years 8 months ago
Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on cur...
Davide Chiarotto, Osvaldo Simeone, Michele Zorzi
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 8 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, ...
IDA
2009
Springer
13 years 7 months ago
Trajectory Voting and Classification Based on Spatiotemporal Similarity in Moving Object Databases
We propose a method for trajectory classification based on trajectory voting in Moving Object Databases (MOD). Trajectory voting is performed based on local trajectory similarity. ...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
WWW
2006
ACM
14 years 10 months ago
The web structure of e-government - developing a methodology for quantitative evaluation
In this paper we describe preliminary work that examines whether statistical properties of the structure of websites can be an informative measure of their quality. We aim to deve...
Vaclav Petricek, Tobias Escher, Ingemar J. Cox, He...