Sciweavers

1336 search results - page 125 / 268
» SMTP Path Analysis
Sort
View
ANTSW
2006
Springer
14 years 29 days ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
PTS
2008
165views Hardware» more  PTS 2008»
13 years 10 months ago
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Farn Wang, Geng-Dian Huang
AIPS
2006
13 years 10 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
AAAI
1993
13 years 10 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler