Sciweavers

2796 search results - page 486 / 560
» The coolest path problem
Sort
View
152
Voted
ENTCS
2006
119views more  ENTCS 2006»
15 years 5 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
157
Voted
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
15 years 5 months ago
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
Chinnappan Jayakumar, Chenniappan Chellappan
JSAC
2008
115views more  JSAC 2008»
15 years 5 months ago
A Game-Theoretical Study of Robust Networked Systems
This paper analyses the robustness of networked systems from a game-theoretical perspective. Networked systems often consist of several subsystems sharing resources interdependentl...
Chi-Kin Chau
ORL
2008
77views more  ORL 2008»
15 years 5 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...
164
Voted
NETWORK
2006
96views more  NETWORK 2006»
15 years 5 months ago
Optimizing TCP and RLC interaction in the UMTS radio access network
TCP, the dominant transport protocol for Internet applications, suffers severe performance degradation due to packet losses when a wireless link is present in the endto-end path. ...
Juan J. Alcaraz, Fernando Cerdán, Joan Garc...